oj.uz

Submission #208722

# Submission time Handle Problem Language Result Execution time Memory
208722 2020-03-12T05:34:32 Z E869120 Senior Postmen (BOI14_postmen) C++14
55 / 100
 500 ms 42600 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 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;
	vector<vector<int>> ans;
	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; vector<int> vec;
		while (true) {
			vec.push_back(cx);
			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.push_back(cnt);
		for (int i : vec) used[i] = false;

		vector<int> v1;
		for (int i = 0; i < vec.size(); 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;
				}
				ans.push_back(ret);
			}
			used[vec[i]] = true;
			v1.push_back(vec[i]);
		}
	}

	for (int i = 0; i < ans.size(); i++) {
		for (int j = 0; j < ans[i].size(); j++) { if (j) printf(" "); printf("%d", ans[i][j]); }
		printf("\n");
	}
	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:27: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:28:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    if (cur[cnt] < X[cnt].size()) break;
        ~~~~~~~~~^~~~~~~~~~~~~~~
postmen.cpp:49:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int i = 0; i < vec.size(); i++) {
                   ~~^~~~~~~~~~~~
postmen.cpp:65:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < ans.size(); i++) {
                  ~~^~~~~~~~~~~~
postmen.cpp:66:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int j = 0; j < ans[i].size(); j++) { if (j) printf(" "); printf("%d", ans[i][j]); }
                   ~~^~~~~~~~~~~~~~~
postmen.cpp:16: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:18: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 12 ms 12672 KB Output is correct
2 Correct 12 ms 12672 KB Output is correct
3 Correct 12 ms 12672 KB Output is correct
4 Correct 13 ms 12800 KB Output is correct
5 Correct 14 ms 12672 KB Output is correct
6 Correct 14 ms 12928 KB Output is correct
7 Correct 22 ms 13572 KB Output is correct
8 Correct 15 ms 12800 KB Output is correct
9 Correct 56 ms 17120 KB Output is correct
10 Correct 14 ms 12800 KB Output is correct
11 Correct 18 ms 12800 KB Output is correct
12 Correct 91 ms 17632 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 12672 KB Output is correct
2 Correct 13 ms 12672 KB Output is correct
3 Correct 12 ms 12620 KB Output is correct
4 Correct 14 ms 12976 KB Output is correct
5 Correct 12 ms 12800 KB Output is correct
6 Correct 14 ms 12956 KB Output is correct
7 Correct 19 ms 13600 KB Output is correct
8 Correct 14 ms 12800 KB Output is correct
9 Correct 55 ms 17144 KB Output is correct
10 Correct 14 ms 12928 KB Output is correct
11 Correct 14 ms 12800 KB Output is correct
12 Correct 74 ms 17632 KB Output is correct
13 Correct 87 ms 18804 KB Output is correct
14 Correct 94 ms 18928 KB Output is correct
15 Correct 114 ms 19732 KB Output is correct
16 Correct 88 ms 18804 KB Output is correct
17 Correct 111 ms 19632 KB Output is correct
18 Correct 104 ms 19036 KB Output is correct

Subtask #3
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 12648 KB Output is correct
2 Correct 12 ms 12672 KB Output is correct
3 Correct 15 ms 12672 KB Output is correct
4 Correct 15 ms 12980 KB Output is correct
5 Correct 12 ms 12672 KB Output is correct
6 Correct 16 ms 12928 KB Output is correct
7 Correct 19 ms 13568 KB Output is correct
8 Correct 14 ms 12800 KB Output is correct
9 Correct 59 ms 17120 KB Output is correct
10 Correct 15 ms 12800 KB Output is correct
11 Correct 17 ms 12800 KB Output is correct
12 Correct 64 ms 17656 KB Output is correct
13 Correct 95 ms 18760 KB Output is correct
14 Correct 100 ms 18904 KB Output is correct
15 Correct 97 ms 19652 KB Output is correct
16 Correct 91 ms 18876 KB Output is correct
17 Correct 107 ms 19632 KB Output is correct
18 Correct 95 ms 18960 KB Output is correct
19 Execution timed out 537 ms 42600 KB Time limit exceeded
20 Halted 0 ms 0 KB -