oj.uz

Submission #46508

# Submission time Handle Problem Language Result Execution time Memory
46508 2018-04-21T08:14:11 Z Bruteforceman Nice sequence (IZhO18_sequence) C++11
76 / 100
 2000 ms 34584 KB 
#include "bits/stdc++.h"
using namespace std;
int N, M;
vector <int> g[400010];
int solution[400010], pref[400010];
int deg[400010];
int v[400010];

bool good(int size) {
	for(int i = 0; i <= size; i++) {
		g[i].clear();
		deg[i] = 0;
	}
	for(int i = N; i <= size; i++) {
		g[i].push_back(i - N);
		++deg[i - N];
	}
	for(int i = 0; i <= size - M; i++) {
		g[i].push_back(i + M);
		++deg[i + M];
	}
	queue <int> Q;
	for(int i = 0; i <= size; i++) {
		if(deg[i] == 0) {
			Q.push(i);
		}
	}
	int cnt = 0;
	while(!Q.empty()) {
		int x = Q.front();
		Q.pop();
		cnt++;
		for(auto i : g[x]) {
			--deg[i];
			if(deg[i] == 0) {
				Q.push(i);
			}
		}
	}
	if(cnt == size + 1) {
		return true;
	}
	return false;
}

void solve(int size) {
	for(int i = 0; i <= size; i++) {
		g[i].clear();
		deg[i] = 0;
	}
	for(int i = N; i <= size; i++) {
		g[i].push_back(i - N);
		++deg[i - N];
	}
	for(int i = 0; i <= size - M; i++) {
		g[i].push_back(i + M);
		++deg[i + M];
	}
	queue <int> Q;
	for(int i = 0; i <= size; i++) {
		if(deg[i] == 0) {
			Q.push(i);
		}
	}
	int cnt = 0;
	while(!Q.empty()) {
		int x = Q.front();
		Q.pop();
		v[cnt++] = x;
		for(auto i : g[x]) {
			--deg[i];
			if(deg[i] == 0) {
				Q.push(i);
			}
		}
	}
	if(cnt == size + 1) {
		for(int i = 0; i < cnt; i++) {
			if(v[i] == 0) {
				int cur = 0;
				for(int j = i-1; j >= 0; j--) {
					pref[v[j]] = --cur; 
				}
				cur = 0;
				for(int j = i+1; j < cnt; j++) {
					pref[v[j]] = ++cur;
				}
				break;
			}
		}
		for(int i = 1; i <= size; i++) {
			solution[i] = pref[i] - pref[i - 1];
		}
	}
}

int search(int b, int e) {
	if(b == e) {
		return b;
	}
	int m = (b + e + 1) >> 1;
	if(good(m)) return search(m, e);
	else return search(b, m - 1);
}

int main(int argc, char const *argv[])
{
	int test;
	scanf("%d", &test);
	for(int cs = 1; cs <= test; cs++) {
		scanf("%d %d", &N, &M);		
		int ans = search(min(N, M) - 1, N + M - 1);
		solve(ans);
		printf("%d\n", ans);
		for(int i = 1; i <= ans; i++) {
			printf("%d ", solution[i]);
		}
		printf("\n");
	}
	return 0; 
}

Compilation message

sequence.cpp: In function 'int main(int, const char**)':
sequence.cpp:109:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &test);
  ~~~~~^~~~~~~~~~~~~
sequence.cpp:111:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d", &N, &M);  
   ~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 9720 KB Ok
2 Correct 12 ms 9720 KB Ok
3 Correct 10 ms 9880 KB Ok
4 Correct 10 ms 9880 KB Ok
5 Correct 9 ms 9880 KB Ok
6 Correct 9 ms 9880 KB Ok
7 Correct 9 ms 9880 KB Ok
8 Correct 9 ms 9940 KB Ok
9 Correct 9 ms 9948 KB Ok
10 Correct 16 ms 10096 KB Ok
11 Correct 9 ms 10096 KB Ok
12 Correct 10 ms 10096 KB Ok

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 10096 KB Ok
2 Correct 9 ms 10096 KB Ok
3 Correct 10 ms 10096 KB Ok
4 Correct 12 ms 10096 KB Ok
5 Correct 9 ms 10096 KB Ok
6 Correct 14 ms 10096 KB Ok
7 Correct 37 ms 10732 KB Ok
8 Correct 23 ms 10732 KB Ok
9 Correct 49 ms 10892 KB Ok
10 Correct 27 ms 10892 KB Ok

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 10892 KB Ok
2 Correct 9 ms 10892 KB Ok
3 Correct 9 ms 10892 KB Ok
4 Correct 9 ms 10892 KB Ok
5 Correct 10 ms 10892 KB Ok
6 Correct 10 ms 10892 KB Ok
7 Correct 9 ms 10892 KB Ok
8 Correct 9 ms 10892 KB Ok
9 Correct 9 ms 10892 KB Ok
10 Correct 9 ms 10892 KB Ok
11 Correct 9 ms 10892 KB Ok

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 10892 KB Ok
2 Correct 9 ms 10892 KB Ok
3 Correct 9 ms 10892 KB Ok
4 Correct 9 ms 10892 KB Ok
5 Correct 9 ms 10892 KB Ok
6 Correct 345 ms 20644 KB Ok
7 Correct 342 ms 21456 KB Ok
8 Correct 653 ms 23464 KB Ok
9 Correct 453 ms 23464 KB Ok
10 Correct 286 ms 23464 KB Ok
11 Correct 448 ms 23464 KB Ok

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 9720 KB Ok
2 Correct 12 ms 9720 KB Ok
3 Correct 10 ms 9880 KB Ok
4 Correct 10 ms 9880 KB Ok
5 Correct 9 ms 9880 KB Ok
6 Correct 9 ms 9880 KB Ok
7 Correct 9 ms 9880 KB Ok
8 Correct 9 ms 9940 KB Ok
9 Correct 9 ms 9948 KB Ok
10 Correct 16 ms 10096 KB Ok
11 Correct 9 ms 10096 KB Ok
12 Correct 10 ms 10096 KB Ok
13 Correct 17 ms 10892 KB Ok
14 Correct 9 ms 10892 KB Ok
15 Correct 9 ms 10892 KB Ok
16 Correct 9 ms 10892 KB Ok
17 Correct 10 ms 10892 KB Ok
18 Correct 10 ms 10892 KB Ok
19 Correct 9 ms 10892 KB Ok
20 Correct 9 ms 10892 KB Ok
21 Correct 9 ms 10892 KB Ok
22 Correct 9 ms 10892 KB Ok
23 Correct 9 ms 10892 KB Ok
24 Correct 15 ms 23464 KB Ok
25 Correct 15 ms 23464 KB Ok
26 Correct 14 ms 23464 KB Ok
27 Correct 13 ms 23464 KB Ok
28 Correct 13 ms 23464 KB Ok
29 Correct 13 ms 23464 KB Ok
30 Correct 13 ms 23464 KB Ok
31 Correct 14 ms 23464 KB Ok
32 Correct 14 ms 23464 KB Ok
33 Correct 14 ms 23464 KB Ok
34 Correct 22 ms 23464 KB Ok
35 Correct 20 ms 23464 KB Ok
36 Correct 20 ms 23464 KB Ok
37 Correct 20 ms 23464 KB Ok
38 Correct 20 ms 23464 KB Ok
39 Correct 19 ms 23464 KB Ok
40 Correct 20 ms 23464 KB Ok
41 Correct 20 ms 23464 KB Ok
42 Correct 20 ms 23464 KB Ok
43 Correct 23 ms 23464 KB Ok

Subtask #6
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 9720 KB Ok
2 Correct 12 ms 9720 KB Ok
3 Correct 10 ms 9880 KB Ok
4 Correct 10 ms 9880 KB Ok
5 Correct 9 ms 9880 KB Ok
6 Correct 9 ms 9880 KB Ok
7 Correct 9 ms 9880 KB Ok
8 Correct 9 ms 9940 KB Ok
9 Correct 9 ms 9948 KB Ok
10 Correct 16 ms 10096 KB Ok
11 Correct 9 ms 10096 KB Ok
12 Correct 10 ms 10096 KB Ok
13 Correct 9 ms 10096 KB Ok
14 Correct 9 ms 10096 KB Ok
15 Correct 10 ms 10096 KB Ok
16 Correct 12 ms 10096 KB Ok
17 Correct 9 ms 10096 KB Ok
18 Correct 14 ms 10096 KB Ok
19 Correct 37 ms 10732 KB Ok
20 Correct 23 ms 10732 KB Ok
21 Correct 49 ms 10892 KB Ok
22 Correct 27 ms 10892 KB Ok
23 Correct 17 ms 10892 KB Ok
24 Correct 9 ms 10892 KB Ok
25 Correct 9 ms 10892 KB Ok
26 Correct 9 ms 10892 KB Ok
27 Correct 10 ms 10892 KB Ok
28 Correct 10 ms 10892 KB Ok
29 Correct 9 ms 10892 KB Ok
30 Correct 9 ms 10892 KB Ok
31 Correct 9 ms 10892 KB Ok
32 Correct 9 ms 10892 KB Ok
33 Correct 9 ms 10892 KB Ok
34 Correct 15 ms 23464 KB Ok
35 Correct 15 ms 23464 KB Ok
36 Correct 14 ms 23464 KB Ok
37 Correct 13 ms 23464 KB Ok
38 Correct 13 ms 23464 KB Ok
39 Correct 13 ms 23464 KB Ok
40 Correct 13 ms 23464 KB Ok
41 Correct 14 ms 23464 KB Ok
42 Correct 14 ms 23464 KB Ok
43 Correct 14 ms 23464 KB Ok
44 Correct 22 ms 23464 KB Ok
45 Correct 20 ms 23464 KB Ok
46 Correct 20 ms 23464 KB Ok
47 Correct 20 ms 23464 KB Ok
48 Correct 20 ms 23464 KB Ok
49 Correct 19 ms 23464 KB Ok
50 Correct 20 ms 23464 KB Ok
51 Correct 20 ms 23464 KB Ok
52 Correct 20 ms 23464 KB Ok
53 Correct 23 ms 23464 KB Ok
54 Correct 251 ms 23464 KB Ok
55 Correct 292 ms 23464 KB Ok
56 Correct 303 ms 23464 KB Ok
57 Correct 209 ms 23464 KB Ok
58 Correct 255 ms 23464 KB Ok
59 Correct 255 ms 23464 KB Ok
60 Correct 206 ms 23464 KB Ok
61 Correct 213 ms 23464 KB Ok
62 Correct 304 ms 23464 KB Ok
63 Correct 239 ms 23464 KB Ok
64 Correct 289 ms 23464 KB Ok
65 Correct 271 ms 23464 KB Ok
66 Correct 238 ms 23464 KB Ok
67 Correct 223 ms 23464 KB Ok
68 Correct 252 ms 23464 KB Ok
69 Correct 596 ms 23464 KB Ok
70 Correct 641 ms 23464 KB Ok
71 Correct 546 ms 23464 KB Ok
72 Correct 633 ms 23464 KB Ok
73 Correct 554 ms 23464 KB Ok
74 Correct 505 ms 23464 KB Ok
75 Correct 573 ms 23464 KB Ok
76 Correct 595 ms 23464 KB Ok
77 Correct 462 ms 23464 KB Ok
78 Correct 617 ms 23464 KB Ok
79 Correct 550 ms 23464 KB Ok
80 Correct 537 ms 23464 KB Ok
81 Correct 583 ms 23464 KB Ok
82 Correct 525 ms 23464 KB Ok
83 Correct 502 ms 23464 KB Ok

Subtask #7
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 9720 KB Ok
2 Correct 12 ms 9720 KB Ok
3 Correct 10 ms 9880 KB Ok
4 Correct 10 ms 9880 KB Ok
5 Correct 9 ms 9880 KB Ok
6 Correct 9 ms 9880 KB Ok
7 Correct 9 ms 9880 KB Ok
8 Correct 9 ms 9940 KB Ok
9 Correct 9 ms 9948 KB Ok
10 Correct 16 ms 10096 KB Ok
11 Correct 9 ms 10096 KB Ok
12 Correct 10 ms 10096 KB Ok
13 Correct 9 ms 10096 KB Ok
14 Correct 9 ms 10096 KB Ok
15 Correct 10 ms 10096 KB Ok
16 Correct 12 ms 10096 KB Ok
17 Correct 9 ms 10096 KB Ok
18 Correct 14 ms 10096 KB Ok
19 Correct 37 ms 10732 KB Ok
20 Correct 23 ms 10732 KB Ok
21 Correct 49 ms 10892 KB Ok
22 Correct 27 ms 10892 KB Ok
23 Correct 17 ms 10892 KB Ok
24 Correct 9 ms 10892 KB Ok
25 Correct 9 ms 10892 KB Ok
26 Correct 9 ms 10892 KB Ok
27 Correct 10 ms 10892 KB Ok
28 Correct 10 ms 10892 KB Ok
29 Correct 9 ms 10892 KB Ok
30 Correct 9 ms 10892 KB Ok
31 Correct 9 ms 10892 KB Ok
32 Correct 9 ms 10892 KB Ok
33 Correct 9 ms 10892 KB Ok
34 Correct 9 ms 10892 KB Ok
35 Correct 9 ms 10892 KB Ok
36 Correct 9 ms 10892 KB Ok
37 Correct 9 ms 10892 KB Ok
38 Correct 9 ms 10892 KB Ok
39 Correct 345 ms 20644 KB Ok
40 Correct 342 ms 21456 KB Ok
41 Correct 653 ms 23464 KB Ok
42 Correct 453 ms 23464 KB Ok
43 Correct 286 ms 23464 KB Ok
44 Correct 448 ms 23464 KB Ok
45 Correct 15 ms 23464 KB Ok
46 Correct 15 ms 23464 KB Ok
47 Correct 14 ms 23464 KB Ok
48 Correct 13 ms 23464 KB Ok
49 Correct 13 ms 23464 KB Ok
50 Correct 13 ms 23464 KB Ok
51 Correct 13 ms 23464 KB Ok
52 Correct 14 ms 23464 KB Ok
53 Correct 14 ms 23464 KB Ok
54 Correct 14 ms 23464 KB Ok
55 Correct 22 ms 23464 KB Ok
56 Correct 20 ms 23464 KB Ok
57 Correct 20 ms 23464 KB Ok
58 Correct 20 ms 23464 KB Ok
59 Correct 20 ms 23464 KB Ok
60 Correct 19 ms 23464 KB Ok
61 Correct 20 ms 23464 KB Ok
62 Correct 20 ms 23464 KB Ok
63 Correct 20 ms 23464 KB Ok
64 Correct 23 ms 23464 KB Ok
65 Correct 251 ms 23464 KB Ok
66 Correct 292 ms 23464 KB Ok
67 Correct 303 ms 23464 KB Ok
68 Correct 209 ms 23464 KB Ok
69 Correct 255 ms 23464 KB Ok
70 Correct 255 ms 23464 KB Ok
71 Correct 206 ms 23464 KB Ok
72 Correct 213 ms 23464 KB Ok
73 Correct 304 ms 23464 KB Ok
74 Correct 239 ms 23464 KB Ok
75 Correct 289 ms 23464 KB Ok
76 Correct 271 ms 23464 KB Ok
77 Correct 238 ms 23464 KB Ok
78 Correct 223 ms 23464 KB Ok
79 Correct 252 ms 23464 KB Ok
80 Correct 596 ms 23464 KB Ok
81 Correct 641 ms 23464 KB Ok
82 Correct 546 ms 23464 KB Ok
83 Correct 633 ms 23464 KB Ok
84 Correct 554 ms 23464 KB Ok
85 Correct 505 ms 23464 KB Ok
86 Correct 573 ms 23464 KB Ok
87 Correct 595 ms 23464 KB Ok
88 Correct 462 ms 23464 KB Ok
89 Correct 617 ms 23464 KB Ok
90 Correct 550 ms 23464 KB Ok
91 Correct 537 ms 23464 KB Ok
92 Correct 583 ms 23464 KB Ok
93 Correct 525 ms 23464 KB Ok
94 Correct 502 ms 23464 KB Ok
95 Correct 633 ms 25112 KB Ok
96 Correct 1068 ms 32136 KB Ok
97 Correct 1006 ms 32136 KB Ok
98 Correct 714 ms 32136 KB Ok
99 Correct 918 ms 32136 KB Ok
100 Correct 961 ms 32136 KB Ok
101 Correct 932 ms 32136 KB Ok
102 Correct 865 ms 32136 KB Ok
103 Correct 897 ms 32136 KB Ok
104 Correct 1050 ms 32136 KB Ok
105 Correct 1033 ms 32136 KB Ok
106 Correct 827 ms 32136 KB Ok
107 Correct 940 ms 32136 KB Ok
108 Correct 1275 ms 32136 KB Ok
109 Correct 1016 ms 32264 KB Ok
110 Execution timed out 2067 ms 34584 KB Time limit exceeded
111 Halted 0 ms 0 KB -