Code Submission Evaluation System Login

HIIT Open 2018

Start:2018-05-26 11:00:00
End:2018-05-26 16:00:00
 

Tasks | Messages | Scoreboard | Statistics


CSES - HIIT Open 2018 - Results
History
2018-05-26 14:46:43
2018-05-26 14:17:06
2018-05-26 13:59:11
2018-05-26 13:40:17
Task:Monotonic
Sender:Karhukopla
Submission time:2018-05-26 14:46:43
Language:C++
Status:READY
Result:ACCEPTED

Test results

testverdicttime (s)
#1ACCEPTED0.01 / 2.00details
#2ACCEPTED0.02 / 2.00details
#3ACCEPTED0.02 / 2.00details
#4ACCEPTED0.04 / 2.00details
#5ACCEPTED0.01 / 2.00details
#6ACCEPTED0.01 / 2.00details
#7ACCEPTED0.01 / 2.00details
#8ACCEPTED0.02 / 2.00details
#9ACCEPTED0.03 / 2.00details
#10ACCEPTED0.02 / 2.00details

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
3 4
4 3
1 2
2 3
3 4
2 1
1 2
view   save

correct output
-1
3
1
view   save

user output
-1
3
1
view   save

Test 2

Verdict: ACCEPTED

input
10
15 200
1 14
2 6
3 14
12 13
11 14
5 10
4 10
1 10
3 11
7 11
7 13
12 14
6 9
9 15
8 9
5 15
1 14
1 6
...
view   save

correct output
-1
-1
-1
-1
-1
-1
-1
-1
-1
2
view   save

user output
-1
-1
-1
-1
-1
-1
-1
-1
-1
2
view   save

Test 3

Verdict: ACCEPTED

input
10
15 350
1 14
2 6
3 14
12 13
11 14
5 10
4 10
1 10
3 11
7 11
7 13
12 14
6 9
9 15
8 9
5 15
1 14
1 6
...
view   save

correct output
3
-1
2
-1
1
2
2
2
-1
-1
view   save

user output
3
-1
2
-1
1
2
2
2
-1
-1
view   save

Test 4

Verdict: ACCEPTED

input
10
15 1500
1 14
2 6
3 14
12 13
11 14
5 10
4 10
1 10
3 11
7 11
7 13
12 14
6 9
9 15
8 9
5 15
1 14
1 6
...
view   save

correct output
1
1
1
1
1
1
1
1
1
1
view   save

user output
1
1
1
1
1
1
1
1
1
1
view   save

Test 5

Verdict: ACCEPTED

input
10
15 100
4 10
3 9
6 15
8 10
10 11
2 10
1 15
8 14
5 9
4 12
8 9
9 14
7 8
11 14
3 4
3 11
14 15
7 9
...
view   save

correct output
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
view   save

user output
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
view   save

Test 6

Verdict: ACCEPTED

input
10
15 200
4 5
2 12
7 8
2 3
1 2
7 9
5 15
1 13
4 9
6 9
5 13
3 14
2 5
4 15
1 14
11 13
5 13
4 5
...
view   save

correct output
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
view   save

user output
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
view   save

Test 7

Verdict: ACCEPTED

input
10
15 300
5 10
6 12
12 13
12 14
11 15
1 9
8 14
4 13
1 11
3 15
2 6
8 14
4 7
2 9
4 10
1 12
4 7
3 5
...
view   save

correct output
-1
-1
2
2
-1
2
-1
2
-1
-1
view   save

user output
-1
-1
2
2
-1
2
-1
2
-1
-1
view   save

Test 8

Verdict: ACCEPTED

input
10
15 400
10 13
2 14
8 13
1 5
1 3
10 11
8 13
6 12
6 13
1 5
8 13
4 12
7 14
9 15
9 11
2 4
9 10
12 13
...
view   save

correct output
-1
1
1
-1
1
2
2
2
1
2
view   save

user output
-1
1
1
-1
1
2
2
2
1
2
view   save

Test 9

Verdict: ACCEPTED

input
10
15 14
14 15
11 12
1 2
13 14
7 8
6 7
4 5
9 10
8 9
12 13
5 6
2 3
10 11
3 4
15 28
3 4
4 5
12 13
...
view   save

correct output
8
7
4
4
3
3
2
2
2
2
view   save

user output
8
7
4
4
3
3
2
2
2
2
view   save

Test 10

Verdict: ACCEPTED

input
10
15 14
1 2
2 3
3 4
4 5
5 6
6 7
7 8
8 9
9 10
10 11
11 12
12 13
13 14
14 15
15 28
1 2
2 3
3 4
...
view   save

correct output
14
7
5
4
3
3
2
2
2
2
view   save

user output
14
7
5
4
3
3
2
2
2
2
view   save