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 15:46:02
2018-05-26 15:02:00
Task:Monotonic
Sender:KnowYourArchitecture
Submission time:2018-05-26 15:46:02
Language:C++
Status:READY
Result:ACCEPTED

Test results

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

Code

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef __int128 lll;

constexpr int N = 1000;

mt19937 rnd;
uniform_int_distribution<int> dist(0, 100);

typedef pair<int, int> op;

template<typename T>
void exec(vector<T> &v, vector<op> ops) {
	for (auto o : ops) {
		if (v[o.first] > v[o.second]) {
			swap(v[o.first], v[o.second]);
		}
	}
}

template<typename T>
bool isOrder(const vector<T> &v) {
	for(size_t i = 1; i < v.size(); i++) {
		if (!(v[i-1] <= v[i])) return false;
	}
	return true;
}

inline bool ready(vector<int> &v, int n) {
	int mask = (1 << (n)) - 1;
	for (int a : v) {
		if ((a & mask) != mask) return false;
	}
	return true;
}

void test() {
	int n, m;
	cin >> n >> m;
	vector<int> v(n);
	vector<op> ops(m);
	for (auto &o : ops) {
		cin >> o.first >> o.second;
		o.first--;
		o.second--;
	}
	
	
	// Iterate until ready
	int K = 0;
	for (int t = 0; t < N; t++) {
		// Init v
		for (int i = 0; i < n; i++)
			v[i] = dist(rnd);
		//for (int a:v)cout<<a<<" ";cout<<endl;
		int k = 0;
		while (!isOrder(v) && k++ < 16) {
			exec(v, ops);
		//for (int a:v)cout<<a<<" ";cout<<endl;
		}
		if (k == 17) {
			cout << "-1\n";
			return;
		}
		K = max(k, K);
		
	}
	cout << K << "\n";
}

int main(){
	int t;
	cin>>t;
	while(t--)test();
}

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