oj.uz

Submission #208727

# Submission time Handle Problem Language Result Execution time Memory
208727 2020-03-12T05:38:29 Z E869120 Senior Postmen (BOI14_postmen) C++14
55 / 100
 500 ms 44104 KB 
#include <iostream>
#include <vector>
#include <set>
using namespace std;
#pragma warning (disable: 4996)

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

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

int vec[1 << 19], sz;

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;

		vector<int> v1;
		for (int i = 0; i < sz; i++) {
			if (used[vec[i]] == true) {
				vector<int> ret;
				while (true) {
					int cp = v1[v1.size() - 1];
					ret.push_back(cp); used[cp] = false;
					v1.pop_back();
					if (cp == vec[i]) break;
				}
				for (int j = 0; j < ret.size(); j++) { if (j) printf(" "); printf("%d", ret[j]); }
				printf("\n");
			}
			used[vec[i]] = true;
			v1.push_back(vec[i]);
		}
	}
	return 0;
}

Compilation message

postmen.cpp:5:0: warning: ignoring #pragma warning  [-Wunknown-pragmas]
 #pragma warning (disable: 4996)
 
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:59:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int j = 0; j < ret.size(); j++) { if (j) printf(" "); printf("%d", ret[j]); }
                     ~~^~~~~~~~~~~~
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 15 ms 12672 KB Output is correct
2 Correct 12 ms 12672 KB Output is correct
3 Correct 13 ms 12672 KB Output is correct
4 Correct 17 ms 12800 KB Output is correct
5 Correct 13 ms 12672 KB Output is correct
6 Correct 14 ms 12928 KB Output is correct
7 Correct 19 ms 13568 KB Output is correct
8 Correct 13 ms 12800 KB Output is correct
9 Correct 58 ms 16756 KB Output is correct
10 Correct 14 ms 12800 KB Output is correct
11 Correct 14 ms 12800 KB Output is correct
12 Correct 81 ms 17284 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 12648 KB Output is correct
2 Correct 11 ms 12656 KB Output is correct
3 Correct 14 ms 12596 KB Output is correct
4 Correct 17 ms 12800 KB Output is correct
5 Correct 12 ms 12672 KB Output is correct
6 Correct 13 ms 12928 KB Output is correct
7 Correct 20 ms 13568 KB Output is correct
8 Correct 13 ms 12800 KB Output is correct
9 Correct 55 ms 16760 KB Output is correct
10 Correct 14 ms 12800 KB Output is correct
11 Correct 14 ms 12800 KB Output is correct
12 Correct 62 ms 17272 KB Output is correct
13 Correct 90 ms 18932 KB Output is correct
14 Correct 102 ms 17748 KB Output is correct
15 Correct 101 ms 17192 KB Output is correct
16 Correct 138 ms 18968 KB Output is correct
17 Correct 126 ms 17544 KB Output is correct
18 Correct 115 ms 18284 KB Output is correct

Subtask #3
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 12692 KB Output is correct
2 Correct 11 ms 12672 KB Output is correct
3 Correct 12 ms 12672 KB Output is correct
4 Correct 14 ms 12800 KB Output is correct
5 Correct 12 ms 12672 KB Output is correct
6 Correct 19 ms 12928 KB Output is correct
7 Correct 20 ms 13544 KB Output is correct
8 Correct 14 ms 12800 KB Output is correct
9 Correct 56 ms 16760 KB Output is correct
10 Correct 14 ms 12800 KB Output is correct
11 Correct 14 ms 12928 KB Output is correct
12 Correct 65 ms 17328 KB Output is correct
13 Correct 92 ms 18924 KB Output is correct
14 Correct 98 ms 17632 KB Output is correct
15 Correct 102 ms 17072 KB Output is correct
16 Correct 98 ms 18932 KB Output is correct
17 Correct 109 ms 17528 KB Output is correct
18 Correct 93 ms 18276 KB Output is correct
19 Execution timed out 532 ms 44104 KB Time limit exceeded
20 Halted 0 ms 0 KB -