Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <iomanip>
- #include <string>
- #include <sstream>
- #include <algorithm>
- #include <vector>
- #include <stdlib.h>
- #include <stdio.h>
- #include <fstream>
- #include <stack>
- #include <map>
- #include <cstring>
- #include <cmath>
- using namespace std;
- int main()
- {
- int i, j, a, k, MonkoX, omegahead, n , b, c, d, Twohead;
- bool NextStep;
- cin >> k >> n;
- vector<int> Race(k);
- vector<int>::iterator aFind, bFind, cFind, dFind, Iterator;
- vector <vector<int> > HSBGPuckichTop(n);
- vector <vector<int> >::iterator iter;
- for (i = 0; i != n; i++)
- {
- cin >> a >> b >> c >> d;
- HSBGPuckichTop[i].push_back(a);
- HSBGPuckichTop[i].push_back(b);
- HSBGPuckichTop[i].push_back(c);
- HSBGPuckichTop[i].push_back(d);
- }
- for (i = 0; i < k; i++)
- Race[i] = i + 1;
- if (k > 1)
- {
- do{
- i = 0;
- NextStep = false;
- while ((i < n) & (NextStep == false))
- {
- aFind = find(Race.begin(), Race.end(), HSBGPuckichTop[i][0]);
- bFind = find(Race.begin(), Race.end(), HSBGPuckichTop[i][1]);
- cFind = find(Race.begin(), Race.end(), HSBGPuckichTop[i][2]);
- dFind = find(Race.begin(), Race.end(), HSBGPuckichTop[i][3]);
- if(((aFind < bFind) & (cFind >= dFind)) || ((aFind >= bFind) & (cFind < dFind)))
- i++;
- else
- NextStep = 1;
- }
- if (NextStep == false)
- {
- for (auto Iterator1 = Race.begin(); Iterator1 != Race.end(); Iterator1++)
- cout << *Iterator1 << " ";
- cout << endl;
- return 0;
- }
- }while(next_permutation(Race.begin(), Race.end()) );
- }
- cout << 0;
- return 0;
- }
Add Comment
Please, Sign In to add comment