oj.uz

Submission #713530

# Submission time Handle Problem Language Result Execution time Memory
713530 2023-03-22T11:49:45 Z Pherokung Meetings (JOI19_meetings) C++14
29 / 100
 1846 ms 1792 KB 
#include "meetings.h"
#include<bits/stdc++.h>
using namespace std;
int n,temp;
bool func(int a,int b) {
  return Query(temp,a,b) == a;
}

void Ans(int a,int b){
  if(a > b) swap(a,b);
  Bridge(a,b);
}

void sol(vector<int> v){
  if(v.size() < 2) return;
  //random_shuffle(v.begin(),v.end());

  int a = v[0], b = v[1];
  map<int,vector<int> > mp;
  mp[a].push_back(a), mp[b].push_back(b);
  vector<int> adj;
  for(int i=2;i<v.size();i++){
    int c = Query(a,b,v[i]);
    if(!mp.count(c) ) adj.push_back(c);
    mp[c].push_back(v[i]);
  }

  temp = a;
  sort(adj.begin(), adj.end(), func);

  int now = a;
  for(auto x : adj) Ans(now,x), now = x;
  Ans(now,b);

  for(auto it : mp) sol(it.second);
}
void Solve(int N) {
  n = N;
  vector<int> v(n);
  iota(v.begin(),v.end(),0);
  sol(v);
}

Compilation message

meetings.cpp: In function 'void sol(std::vector<int>)':
meetings.cpp:22:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   22 |   for(int i=2;i<v.size();i++){
      |               ~^~~~~~~~~

Subtask #1
7.0 / 7.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
12.0 / 12.0

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

Subtask #4
0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 345 ms 632 KB Output is correct
2 Correct 394 ms 664 KB Output is correct
3 Correct 369 ms 796 KB Output is correct
4 Correct 356 ms 660 KB Output is correct
5 Correct 247 ms 620 KB Output is correct
6 Correct 264 ms 776 KB Output is correct
7 Correct 332 ms 672 KB Output is correct
8 Correct 377 ms 680 KB Output is correct
9 Correct 383 ms 720 KB Output is correct
10 Correct 357 ms 676 KB Output is correct
11 Correct 396 ms 688 KB Output is correct
12 Correct 298 ms 844 KB Output is correct
13 Correct 195 ms 684 KB Output is correct
14 Correct 371 ms 840 KB Output is correct
15 Correct 256 ms 544 KB Output is correct
16 Correct 296 ms 720 KB Output is correct
17 Correct 595 ms 824 KB Output is correct
18 Incorrect 1846 ms 1792 KB Wrong Answer [2]
19 Halted 0 ms 0 KB -