oj.uz

Submission #375454

# Submission time Handle Problem Language Result Execution time Memory
375454 2021-03-09T12:24:30 Z Seanliu Meetings (JOI19_meetings) C++17
29 / 100
 2000 ms 1452 KB 
#include "meetings.h"
#include <iostream>
#include <map>	
#include <algorithm>
#include <vector>
using namespace std;
 
const int maxN = 2e3 + 326;
vector<int> adj[maxN];

void addEdge(int a, int b){
	//cout << "Adding: " << a << ", " << b << endl;
	if(a > b) Bridge(b, a);
	else Bridge(a, b);
}
 
void solve(vector<int> vec){
	if(vec.size() == 1) return;
	if(vec.size() == 2){
		addEdge(vec[0], vec[1]);
		return;
	}
	//cout << "vec = "; for(int x : vec) cout << x << " "; cout << endl;
	map<int, vector<int>> mp;
	vector<int> nv = vector<int>();
	int a = vec[0], b = vec[1];
	for(int i = 2; i < vec.size(); i++){
		int res = Query(a, b, vec[i]);
		if(res == a) a = vec[i];
		if(res == b) b = vec[i];
	}
	//cout << "a = " << a << ", b = " << b << endl;
	mp[a] = mp[b] = vector<int>();
	mp[a].push_back(a);
	mp[b].push_back(b);
	for(int i = 0; i < vec.size(); i++){
		if(vec[i] == a || vec[i] == b) continue;
		int res = Query(a, b, vec[i]);
		if(!mp.count(res)) mp[res] = vector<int>();
		mp[res].push_back(vec[i]);
	}
	for(auto [x, v] : mp){
		//cout << "x = " << x << ", v = "; for(int y : v) cout << y << " "; cout << endl;
		solve(v);
		if(x != a && x != b) nv.push_back(x);
	}
	sort(nv.begin(), nv.end(), [&](int x, int y){
		return Query(a, x, y) == x;
	});
	//cout << "OK\n";
	//cout << "nv = " << nv.size() << ", vec: " << vec.size() << endl;
	if(nv.size()){
		for(int i = 0; i < nv.size() - 1; i++) addEdge(nv[i], nv[i + 1]);
		addEdge(a, nv[0]);
		addEdge(b, nv[nv.size() - 1]);
	} else addEdge(a, b);
}
 
void Solve(int N){
	vector<int> jizz = vector<int>();
	for(int i = 0; i < N; i++) jizz.push_back(i);
	solve(jizz);
}

Compilation message

meetings.cpp: In function 'void solve(std::vector<int>)':
meetings.cpp:27:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   27 |  for(int i = 2; i < vec.size(); i++){
      |                 ~~^~~~~~~~~~~~
meetings.cpp:36:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   36 |  for(int i = 0; i < vec.size(); i++){
      |                 ~~^~~~~~~~~~~~
meetings.cpp:53:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   53 |   for(int i = 0; i < nv.size() - 1; i++) addEdge(nv[i], nv[i + 1]);
      |                  ~~^~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 512 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 492 KB Output is correct
15 Correct 1 ms 492 KB Output is correct
16 Correct 1 ms 492 KB Output is correct
17 Correct 1 ms 492 KB Output is correct
18 Correct 1 ms 492 KB Output is correct
19 Correct 1 ms 492 KB Output is correct
20 Correct 1 ms 492 KB Output is correct
21 Correct 1 ms 492 KB Output is correct
22 Correct 1 ms 492 KB Output is correct
23 Correct 1 ms 492 KB Output is correct
24 Correct 1 ms 492 KB Output is correct
25 Correct 1 ms 492 KB Output is correct
26 Correct 1 ms 492 KB Output is correct
27 Correct 8 ms 492 KB Output is correct
28 Correct 9 ms 512 KB Output is correct
29 Correct 11 ms 492 KB Output is correct
30 Correct 8 ms 492 KB Output is correct
31 Correct 8 ms 492 KB Output is correct
32 Correct 10 ms 512 KB Output is correct
33 Correct 17 ms 492 KB Output is correct
34 Correct 19 ms 492 KB Output is correct
35 Correct 19 ms 492 KB Output is correct
36 Correct 10 ms 492 KB Output is correct
37 Correct 21 ms 492 KB Output is correct
38 Correct 21 ms 492 KB Output is correct
39 Correct 16 ms 492 KB Output is correct

Subtask #4
0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 762 ms 876 KB Output is correct
2 Correct 869 ms 876 KB Output is correct
3 Correct 867 ms 908 KB Output is correct
4 Correct 850 ms 876 KB Output is correct
5 Correct 651 ms 664 KB Output is correct
6 Correct 746 ms 876 KB Output is correct
7 Correct 902 ms 884 KB Output is correct
8 Correct 990 ms 748 KB Output is correct
9 Correct 987 ms 784 KB Output is correct
10 Correct 959 ms 1012 KB Output is correct
11 Correct 1109 ms 876 KB Output is correct
12 Correct 533 ms 876 KB Output is correct
13 Correct 390 ms 876 KB Output is correct
14 Correct 925 ms 1004 KB Output is correct
15 Correct 544 ms 748 KB Output is correct
16 Correct 723 ms 972 KB Output is correct
17 Correct 884 ms 812 KB Output is correct
18 Execution timed out 2290 ms 1452 KB Time limit exceeded
19 Halted 0 ms 0 KB -