oj.uz

Submission #195578

# Submission time Handle Problem Language Result Execution time Memory
195578 2020-01-16T10:28:30 Z theStaticMind Meetings (JOI19_meetings) C++14
29 / 100
 2000 ms 5060 KB 
#include "meetings.h"
#include<bits/stdc++.h>
#define pb push_back
#define ii pair<int,int>
#define all(x) (x).begin(),(x).end()
using namespace std;

void dp(vector<int>& data,int curr){
      if(data.empty())return;
      int big=data[0];
      vector<int>sub,other;
      set<int> vis;
      sub.pb(big);
      vis.insert(big);
      for(int i=1;i<data.size();i++){
            if(data[i]==big){
                  if(!vis.count(big)){
                        vis.insert(big);
                        sub.pb(big);
                  }
                  continue;
            }
            int q=Query(big,curr,data[i]);
            if(q==curr)other.pb(data[i]);
            else{
                  sub.pb(data[i]);
                  vis.insert(data[i]);
                  big=q;
            }
      }
      Bridge(min(curr,big),max(curr,big));

      sub.erase(find(all(sub),big));
      dp(sub,big);
      dp(other,curr);
}
void Solve(int N){
      srand(time(NULL));
      vector<int>arr;
      int x=rand()%N;
      for(int i=0;i<N;i++)arr.pb(i);
      arr.erase(arr.begin()+x);
      for(int i=0;i<1e5;i++)swap(arr[rand()%(N-1)],arr[rand()%(N-1)]);
      dp(arr,x);
}

Compilation message

meetings.cpp: In function 'void dp(std::vector<int>&, int)':
meetings.cpp:15:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
       for(int i=1;i<data.size();i++){
                   ~^~~~~~~~~~~~

Subtask #1
7.0 / 7.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
12.0 / 12.0

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

Subtask #4
0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 1122 ms 1188 KB Output is correct
2 Correct 1368 ms 1308 KB Output is correct
3 Correct 1264 ms 1208 KB Output is correct
4 Correct 1574 ms 1528 KB Output is correct
5 Correct 1050 ms 1604 KB Output is correct
6 Correct 867 ms 1480 KB Output is correct
7 Correct 641 ms 1188 KB Output is correct
8 Correct 790 ms 1016 KB Output is correct
9 Correct 793 ms 1148 KB Output is correct
10 Correct 762 ms 1192 KB Output is correct
11 Correct 857 ms 1144 KB Output is correct
12 Execution timed out 3052 ms 5060 KB Time limit exceeded
13 Halted 0 ms 0 KB -