oj.uz

Submission #136659

# Submission time Handle Problem Language Result Execution time Memory
136659 2019-07-26T05:04:18 Z E869120 Meetings (JOI19_meetings) C++14
29 / 100
 463 ms 1016 KB 
#include "meetings.h"
#include <vector>
#include <algorithm>
using namespace std;
 
vector<int> vec[1009]; int col[1009];
vector<pair<int, int>> S;
 
void Solve(int N) {
	for (int i = 1; i < N; i++) { vec[i].push_back(i); }
	for (int i = 0; i < N; i++) { vec[0].push_back(i); col[i] = -1; }
 
	for (int i = 1; i < N; i++) {
		for (int j = 1; j < N; j++) {
			if (i == j) continue;
			if (Query(0, i, j) == i) vec[i].push_back(j);
		}
	}
	for (int i = 0; i < N; i++) S.push_back(make_pair(vec[i].size(), i));
	sort(S.begin(), S.end());
 
	for (int i = 0; i < S.size(); i++) {
		int pos = S[i].second; vector<int> I;
		for (int j = 0; j < vec[pos].size(); j++) { if (col[vec[pos][j]] != -1) I.push_back(col[vec[pos][j]]); }
		sort(I.begin(), I.end());
		I.erase(unique(I.begin(), I.end()), I.end());
 
		for (int j = 0; j < I.size(); j++) { int v1 = pos, v2 = I[j]; if (v1 > v2) swap(v1, v2); Bridge(v1, v2); }
		for (int j = 0; j < vec[pos].size(); j++) col[vec[pos][j]] = pos;
	}
	return;
}

Compilation message

meetings.cpp: In function 'void Solve(int)':
meetings.cpp:22:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < S.size(); i++) {
                  ~~^~~~~~~~~~
meetings.cpp:24:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int j = 0; j < vec[pos].size(); j++) { if (col[vec[pos][j]] != -1) I.push_back(col[vec[pos][j]]); }
                   ~~^~~~~~~~~~~~~~~~~
meetings.cpp:28:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int j = 0; j < I.size(); j++) { int v1 = pos, v2 = I[j]; if (v1 > v2) swap(v1, v2); Bridge(v1, v2); }
                   ~~^~~~~~~~~~
meetings.cpp:29:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int j = 0; j < vec[pos].size(); j++) col[vec[pos][j]] = pos;
                   ~~^~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 248 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 248 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 248 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 248 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 248 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 248 KB Output is correct
14 Correct 3 ms 376 KB Output is correct
15 Correct 3 ms 380 KB Output is correct
16 Correct 3 ms 376 KB Output is correct
17 Correct 3 ms 376 KB Output is correct
18 Correct 3 ms 376 KB Output is correct
19 Correct 3 ms 376 KB Output is correct
20 Correct 3 ms 376 KB Output is correct
21 Correct 3 ms 376 KB Output is correct
22 Correct 3 ms 376 KB Output is correct
23 Correct 4 ms 376 KB Output is correct
24 Correct 4 ms 376 KB Output is correct
25 Correct 4 ms 376 KB Output is correct
26 Correct 4 ms 376 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 248 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 248 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 248 KB Output is correct
14 Correct 3 ms 376 KB Output is correct
15 Correct 3 ms 380 KB Output is correct
16 Correct 3 ms 376 KB Output is correct
17 Correct 3 ms 376 KB Output is correct
18 Correct 3 ms 376 KB Output is correct
19 Correct 3 ms 376 KB Output is correct
20 Correct 3 ms 376 KB Output is correct
21 Correct 3 ms 376 KB Output is correct
22 Correct 3 ms 376 KB Output is correct
23 Correct 4 ms 376 KB Output is correct
24 Correct 4 ms 376 KB Output is correct
25 Correct 4 ms 376 KB Output is correct
26 Correct 4 ms 376 KB Output is correct
27 Correct 253 ms 376 KB Output is correct
28 Correct 258 ms 508 KB Output is correct
29 Correct 252 ms 512 KB Output is correct
30 Correct 262 ms 408 KB Output is correct
31 Correct 263 ms 420 KB Output is correct
32 Correct 248 ms 376 KB Output is correct
33 Correct 244 ms 376 KB Output is correct
34 Correct 261 ms 376 KB Output is correct
35 Correct 256 ms 504 KB Output is correct
36 Correct 278 ms 508 KB Output is correct
37 Correct 423 ms 684 KB Output is correct
38 Correct 463 ms 600 KB Output is correct
39 Correct 442 ms 636 KB Output is correct

Subtask #4
0 / 71.0

# Verdict Execution time Memory Grader output
1 Runtime error 4 ms 1016 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -