oj.uz

Submission #208734

# Submission time Handle Problem Language Result Execution time Memory
208734 2020-03-12T05:43:37 Z E869120 Senior Postmen (BOI14_postmen) C++14
55 / 100
 500 ms 41436 KB 
#include <iostream>
#include <vector>
#include <set>
using namespace std;

struct Node {
	int to, cap, rev;
};

int N, M, A[500009], B[500009];
vector<Node> X[500009]; int cur[500009];
bool used[500009];

int vec[500009], sz;
int v1[500009], sz1;

int main() {
	scanf("%d%d", &N, &M);
	for (int i = 1; i <= M; i++) {
		scanf("%d%d", &A[i], &B[i]);
		X[A[i]].push_back(Node{ B[i], 1, (int)X[B[i]].size() });
		X[B[i]].push_back(Node{ A[i], 1, (int)X[A[i]].size() - 1 });
	}

	int num = M, cnt = 1;
	while (num > 0) {
		while (true) {
			while (cur[cnt] < X[cnt].size() && X[cnt][cur[cnt]].cap == 0) cur[cnt]++;
			if (cur[cnt] < X[cnt].size()) break;
			cnt++;
		}

		int cx = cnt; sz = 0;
		while (true) {
			vec[sz] = cx; sz++;
			int nex = -1, res = -1;
			while (X[cx][cur[cx]].cap == 0) cur[cx]++;
			nex = X[cx][cur[cx]].to;
			res = X[cx][cur[cx]].rev;
			X[cx][cur[cx]].cap = 0;
			X[nex][res].cap = 0;
			num--;
			if (nex == cnt) break;
			cx = nex;
		}
		vec[sz] = cnt; sz++;
		for (int i = 0; i < sz; i++) used[vec[i]] = false;

		sz1 = 0;
		for (int i = 0; i < sz; i++) {
			if (used[vec[i]] == true) {
				int num = 0;
				while (true) {
					int cp = v1[sz1 - 1]; if (num) printf(" ");
					printf("%d", cp); num++; used[cp] = false;
					sz1--;
					if (cp == vec[i]) break;
				}
				printf("\n");
			}
			used[vec[i]] = true;
			v1[sz1] = vec[i]; sz1++;
		}
	}
	return 0;
}

Compilation message

postmen.cpp: In function 'int main()':
postmen.cpp:28:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    while (cur[cnt] < X[cnt].size() && X[cnt][cur[cnt]].cap == 0) cur[cnt]++;
           ~~~~~~~~~^~~~~~~~~~~~~~~
postmen.cpp:29:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    if (cur[cnt] < X[cnt].size()) break;
        ~~~~~~~~~^~~~~~~~~~~~~~~
postmen.cpp:18:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d", &N, &M);
  ~~~~~^~~~~~~~~~~~~~~~
postmen.cpp:20:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d", &A[i], &B[i]);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 12032 KB Output is correct
2 Correct 12 ms 12160 KB Output is correct
3 Correct 15 ms 12032 KB Output is correct
4 Correct 13 ms 12264 KB Output is correct
5 Correct 12 ms 12160 KB Output is correct
6 Correct 16 ms 12288 KB Output is correct
7 Correct 18 ms 12928 KB Output is correct
8 Correct 17 ms 12340 KB Output is correct
9 Correct 52 ms 16096 KB Output is correct
10 Correct 13 ms 12288 KB Output is correct
11 Correct 13 ms 12288 KB Output is correct
12 Correct 60 ms 16720 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 12160 KB Output is correct
2 Correct 11 ms 12160 KB Output is correct
3 Correct 12 ms 12032 KB Output is correct
4 Correct 13 ms 12288 KB Output is correct
5 Correct 12 ms 12212 KB Output is correct
6 Correct 14 ms 12320 KB Output is correct
7 Correct 19 ms 12976 KB Output is correct
8 Correct 12 ms 12160 KB Output is correct
9 Correct 53 ms 16248 KB Output is correct
10 Correct 13 ms 12288 KB Output is correct
11 Correct 13 ms 12288 KB Output is correct
12 Correct 59 ms 16632 KB Output is correct
13 Correct 90 ms 17912 KB Output is correct
14 Correct 93 ms 17144 KB Output is correct
15 Correct 100 ms 16556 KB Output is correct
16 Correct 107 ms 17912 KB Output is correct
17 Correct 101 ms 17016 KB Output is correct
18 Correct 91 ms 17528 KB Output is correct

Subtask #3
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 12032 KB Output is correct
2 Correct 14 ms 12032 KB Output is correct
3 Correct 13 ms 12160 KB Output is correct
4 Correct 13 ms 12288 KB Output is correct
5 Correct 13 ms 12160 KB Output is correct
6 Correct 14 ms 12264 KB Output is correct
7 Correct 20 ms 12928 KB Output is correct
8 Correct 15 ms 12160 KB Output is correct
9 Correct 55 ms 16124 KB Output is correct
10 Correct 14 ms 12288 KB Output is correct
11 Correct 13 ms 12416 KB Output is correct
12 Correct 61 ms 16632 KB Output is correct
13 Correct 83 ms 17912 KB Output is correct
14 Correct 100 ms 17144 KB Output is correct
15 Correct 93 ms 16556 KB Output is correct
16 Correct 108 ms 17896 KB Output is correct
17 Correct 95 ms 16992 KB Output is correct
18 Correct 100 ms 17528 KB Output is correct
19 Execution timed out 554 ms 41436 KB Time limit exceeded
20 Halted 0 ms 0 KB -