oj.uz

Submission #210464

# Submission time Handle Problem Language Result Execution time Memory
210464 2020-03-17T12:30:09 Z mhy908 Meetings (JOI19_meetings) C++14
29 / 100
 2000 ms 1272 KB 
#include "meetings.h"
#include <bits/stdc++.h>
#define pb push_back
#define all(x) x.begin(), x.end()
using namespace std;
int st, fin;
bool comp(int a, int b){
    if(a==st||b==fin)return 1;
    if(a==fin||b==st)return 0;
    return Query(st, a, b)==a;
}
unordered_map<int, vector<int> > ump;
void solve(vector<int> vc){
	if(vc.size()<=1)return;
	ump[vc[0]].pb(vc[0]);
	ump[vc[1]].pb(vc[1]);
	vector<int> path;
	path.pb(vc[0]);
	for(int i=2; i<vc.size(); i++){
		int x=Query(vc[0], vc[1], vc[i]);
		if(ump[x].empty())path.pb(x);
		ump[x].pb(vc[i]);
	}
	path.pb(vc[1]);
	st=vc[0], fin=vc[1];
	sort(all(path), comp);
	for(int i=0; i<path.size()-1; i++){
        //printf("%d - %d\n", path[i], path[i+1]);
        Bridge(min(path[i], path[i+1]), max(path[i], path[i+1]));
	}
	for(int i=0; i<path.size(); i++){
		vector<int> temp=ump[path[i]];
		ump[path[i]].clear();
		solve(temp);
	}
}
void Solve(int n){
	vector<int> temp;
	for(int i=0; i<n; i++)temp.pb(i);
	solve(temp);
}

Compilation message

meetings.cpp: In function 'void solve(std::vector<int>)':
meetings.cpp:19:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=2; i<vc.size(); i++){
               ~^~~~~~~~~~
meetings.cpp:27:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0; i<path.size()-1; i++){
               ~^~~~~~~~~~~~~~
meetings.cpp:31:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0; i<path.size(); i++){
               ~^~~~~~~~~~~~

Subtask #1
7.0 / 7.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
12.0 / 12.0

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

Subtask #4
0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 423 ms 888 KB Output is correct
2 Correct 469 ms 760 KB Output is correct
3 Correct 478 ms 1016 KB Output is correct
4 Correct 449 ms 816 KB Output is correct
5 Correct 323 ms 760 KB Output is correct
6 Correct 360 ms 760 KB Output is correct
7 Correct 457 ms 888 KB Output is correct
8 Correct 460 ms 760 KB Output is correct
9 Correct 499 ms 888 KB Output is correct
10 Correct 461 ms 760 KB Output is correct
11 Correct 525 ms 852 KB Output is correct
12 Correct 375 ms 888 KB Output is correct
13 Correct 251 ms 760 KB Output is correct
14 Correct 478 ms 780 KB Output is correct
15 Correct 322 ms 888 KB Output is correct
16 Correct 385 ms 760 KB Output is correct
17 Correct 804 ms 760 KB Output is correct
18 Execution timed out 2312 ms 1272 KB Time limit exceeded
19 Halted 0 ms 0 KB -