CSES - HIIT Open 2018 - Results
Submission details
Task:Monotonic
Sender:Karhukopla
Submission time:2018-05-26 14:46:43
Language:C++
Status:READY
Result:ACCEPTED
Test results
testverdicttime
#1ACCEPTED0.01 sdetails
#2ACCEPTED0.02 sdetails
#3ACCEPTED0.02 sdetails
#4ACCEPTED0.04 sdetails
#5ACCEPTED0.01 sdetails
#6ACCEPTED0.01 sdetails
#7ACCEPTED0.01 sdetails
#8ACCEPTED0.02 sdetails
#9ACCEPTED0.03 sdetails
#10ACCEPTED0.02 sdetails

Code

#include <bits/stdc++.h>

#define ll long long
#define lll __int128
#define pii pair<int, int>
#define M 1000000007
#define N 101
#define PB push_back
#define F first
#define S second
using namespace std;

int solve() {
	int n, m;
	cin>>n>>m;
	pii p[m];
	for (int i = 0; i < m; i++) cin>>p[i].F>>p[i].S, p[i].F--, p[i].S--;
	vector<int> t;
	for (int i = 0; i < n; i++) t.push_back(n - i);
	int ans = 0;
	for (int tt = 0; tt < 50; tt++) {
		for (int sh = 0; sh < n; sh++) {
			vector<int> c(n);
			bool sr = true;
			for (int i = 0; i < n; i++) {
				if (i) sr &= t[(i + sh) % n] > t[(i + sh - 1 + n) % n];
				c[i] = t[(i + sh) % n];
			}
			int op = 0;
			while (!sr) {
				op++;
				
				for (int i = 0; i < m; i++) {
					if (c[p[i].F] > c[p[i].S]) swap(c[p[i].F], c[p[i].S]);
				}
				
				sr = true;
				for (int i = 1; i < n; i++) {
					if (i) sr &= c[i] > c[i - 1];
				}
				if (op == n) return -1;
			}
			ans = max(op, ans);
		}
		random_shuffle(t.begin(), t.end());
	}
	return ans;
}

int main () {
	cin.sync_with_stdio(false);
	cin.tie(0);
	ll t; cin >> t;
	while(t--) cout << solve() << "\n";
}

Test details

Test 1

Verdict: ACCEPTED

input
3
4 4
1 2
3 4
1 2
...

correct output
-1
3
1

user output
-1
3
1

Test 2

Verdict: ACCEPTED

input
10
15 200
1 14
2 6
3 14
...

correct output
-1
-1
-1
-1
-1
...

user output
-1
-1
-1
-1
-1
...

Test 3

Verdict: ACCEPTED

input
10
15 350
1 14
2 6
3 14
...

correct output
3
-1
2
-1
1
...

user output
3
-1
2
-1
1
...

Test 4

Verdict: ACCEPTED

input
10
15 1500
1 14
2 6
3 14
...

correct output
1
1
1
1
1
...

user output
1
1
1
1
1
...

Test 5

Verdict: ACCEPTED

input
10
15 100
4 10
3 9
6 15
...

correct output
-1
-1
-1
-1
-1
...

user output
-1
-1
-1
-1
-1
...

Test 6

Verdict: ACCEPTED

input
10
15 200
4 5
2 12
7 8
...

correct output
-1
-1
-1
-1
-1
...

user output
-1
-1
-1
-1
-1
...

Test 7

Verdict: ACCEPTED

input
10
15 300
5 10
6 12
12 13
...

correct output
-1
-1
2
2
-1
...

user output
-1
-1
2
2
-1
...

Test 8

Verdict: ACCEPTED

input
10
15 400
10 13
2 14
8 13
...

correct output
-1
1
1
-1
1
...

user output
-1
1
1
-1
1
...

Test 9

Verdict: ACCEPTED

input
10
15 14
14 15
11 12
1 2
...

correct output
8
7
4
4
3
...

user output
8
7
4
4
3
...

Test 10

Verdict: ACCEPTED

input
10
15 14
1 2
2 3
3 4
...

correct output
14
7
5
4
3
...

user output
14
7
5
4
3
...