oj.uz

Submission #195574

# Submission time Handle Problem Language Result Execution time Memory
195574 2020-01-16T10:09:45 Z theStaticMind Meetings (JOI19_meetings) C++14
29 / 100
 2000 ms 1284 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;
      sub.pb(big);
      for(int i=1;i<data.size();i++){
            if(data[i]==big){
                  if(!count(all(sub),big))sub.pb(big);
                  continue;
            }
            int q=Query(big,curr,data[i]);
            if(q==curr)other.pb(data[i]);
            else{
                  sub.pb(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){
      vector<int>arr;
      for(int i=1;i<N;i++)arr.pb(i);
      dp(arr,0);
}

Compilation message

meetings.cpp: In function 'void dp(std::vector<int>, int)':
meetings.cpp:13: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 2 ms 248 KB Output is correct
2 Correct 2 ms 248 KB Output is correct
3 Correct 2 ms 248 KB Output is correct
4 Correct 2 ms 248 KB Output is correct
5 Correct 2 ms 248 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 248 KB Output is correct
9 Correct 2 ms 248 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 248 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 248 KB Output is correct
2 Correct 2 ms 248 KB Output is correct
3 Correct 2 ms 248 KB Output is correct
4 Correct 2 ms 248 KB Output is correct
5 Correct 2 ms 248 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 248 KB Output is correct
9 Correct 2 ms 248 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 248 KB Output is correct
13 Correct 2 ms 248 KB Output is correct
14 Correct 2 ms 248 KB Output is correct
15 Correct 2 ms 248 KB Output is correct
16 Correct 2 ms 248 KB Output is correct
17 Correct 2 ms 248 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 248 KB Output is correct
20 Correct 2 ms 248 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 248 KB Output is correct
23 Correct 2 ms 248 KB Output is correct
24 Correct 3 ms 376 KB Output is correct
25 Correct 3 ms 376 KB Output is correct
26 Correct 2 ms 376 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 248 KB Output is correct
3 Correct 2 ms 248 KB Output is correct
4 Correct 2 ms 248 KB Output is correct
5 Correct 2 ms 248 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 248 KB Output is correct
9 Correct 2 ms 248 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 248 KB Output is correct
13 Correct 2 ms 248 KB Output is correct
14 Correct 2 ms 248 KB Output is correct
15 Correct 2 ms 248 KB Output is correct
16 Correct 2 ms 248 KB Output is correct
17 Correct 2 ms 248 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 248 KB Output is correct
20 Correct 2 ms 248 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 248 KB Output is correct
23 Correct 2 ms 248 KB Output is correct
24 Correct 3 ms 376 KB Output is correct
25 Correct 3 ms 376 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 13 ms 504 KB Output is correct
28 Correct 10 ms 376 KB Output is correct
29 Correct 12 ms 376 KB Output is correct
30 Correct 13 ms 412 KB Output is correct
31 Correct 10 ms 376 KB Output is correct
32 Correct 10 ms 376 KB Output is correct
33 Correct 13 ms 504 KB Output is correct
34 Correct 16 ms 360 KB Output is correct
35 Correct 14 ms 404 KB Output is correct
36 Correct 16 ms 504 KB Output is correct
37 Correct 88 ms 760 KB Output is correct
38 Correct 142 ms 856 KB Output is correct
39 Correct 188 ms 924 KB Output is correct

Subtask #4
0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 1216 ms 932 KB Output is correct
2 Correct 1329 ms 916 KB Output is correct
3 Correct 1340 ms 888 KB Output is correct
4 Correct 1619 ms 944 KB Output is correct
5 Correct 1192 ms 892 KB Output is correct
6 Correct 749 ms 928 KB Output is correct
7 Correct 784 ms 900 KB Output is correct
8 Correct 770 ms 920 KB Output is correct
9 Correct 765 ms 888 KB Output is correct
10 Correct 705 ms 760 KB Output is correct
11 Correct 862 ms 900 KB Output is correct
12 Execution timed out 3092 ms 1284 KB Time limit exceeded
13 Halted 0 ms 0 KB -