oj.uz

Submission #961309

# Submission time Handle Problem Language Result Execution time Memory
961309 2024-04-11T19:54:07 Z Prieved1 Longest Trip (IOI23_longesttrip) C++17
30 / 100
 49 ms 4184 KB 
#include "longesttrip.h"
#include <bits/stdc++.h>
using namespace std;
int cnt=0;
int n;
map<int, map<int,int>> mp;
bool query1(int a, int b) {
  if(mp[a][b]!=0)return mp[a][b]-1;
  int c=are_connected({a}, {b});
  mp[a][b]=c+1;
  mp[b][a]=c+1;
  cnt++;
  return c;
}
bool query2(int a, int b) {
 for(int j  = 0;j<n;j++) {
  if(a==j or j==b)continue;
  if(mp[a][j]==1 and mp[j][b]==1) {
    mp[a][b]=2;
    mp[b][a]=2;
    return 1;
  }
 }
 return query1(a,b);
}
vector<int> longest_trip(int N, int D)
{
  n=N;
  cnt=0;
  mp.clear();
  srand(time(NULL));
  vector<int> id(N);
  iota(id.begin(), id.end(), 0);
  random_shuffle(id.begin(), id.end());
  vector<int> t[2];
  t[0].push_back(id[0]);
  for(int ii = 1;ii<N;ii++) {
    int i=id[ii];
    if(t[1].size() > t[0].size())swap(t[0], t[1]);
    if(t[1].size()) {
      if(rand()%2)swap(t[0], t[1]);
    }
    if(rand()%2) {
      reverse(t[0].begin(), t[0].end());
      if(t[1].size() and query2(t[0].back(), t[1].back())) {
          while(t[1].size()) {
            t[0].push_back(t[1].back());
            t[1].pop_back();
          }
      }
    }
    int c=query2(t[0].back(), i);
    if(!c) {
      t[1].push_back(i);
    }
    else {
      t[0].push_back(i);
      if(t[1].size()) {
        c=query2(t[1].back(), i);
        if(c) {
          while(t[1].size()) {
            t[0].push_back(t[1].back());
            t[1].pop_back();
          }
        }
      }
    }
  }
//  assert(cnt<=384);
  if(t[0].size()<t[1].size())swap(t[0], t[1]);
  return t[0];
}

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 340 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 344 KB Output is correct
2 Correct 7 ms 344 KB Output is correct
3 Correct 10 ms 344 KB Output is correct
4 Correct 17 ms 1112 KB Output is correct
5 Correct 29 ms 3672 KB Output is correct

Subtask #2
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 344 KB Output is correct
2 Correct 5 ms 344 KB Output is correct
3 Correct 8 ms 344 KB Output is correct
4 Correct 16 ms 1056 KB Output is correct
5 Correct 30 ms 3672 KB Output is correct
6 Incorrect 0 ms 344 KB Incorrect
7 Halted 0 ms 0 KB -

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 344 KB Output is correct
2 Correct 8 ms 600 KB Output is correct
3 Correct 9 ms 344 KB Output is correct
4 Correct 19 ms 1112 KB Output is correct
5 Correct 32 ms 3960 KB Output is correct
6 Correct 8 ms 344 KB Output is correct
7 Correct 7 ms 600 KB Output is correct
8 Correct 11 ms 344 KB Output is correct
9 Correct 14 ms 1112 KB Output is correct
10 Correct 32 ms 3636 KB Output is correct
11 Correct 29 ms 3672 KB Output is correct
12 Correct 29 ms 3788 KB Output is correct
13 Correct 27 ms 3416 KB Output is correct
14 Correct 7 ms 344 KB Output is correct
15 Correct 8 ms 344 KB Output is correct
16 Correct 8 ms 344 KB Output is correct
17 Correct 10 ms 600 KB Output is correct
18 Correct 11 ms 600 KB Output is correct
19 Correct 17 ms 1128 KB Output is correct
20 Correct 16 ms 856 KB Output is correct
21 Correct 27 ms 3624 KB Output is correct
22 Correct 27 ms 3416 KB Output is correct
23 Correct 32 ms 3568 KB Output is correct
24 Correct 35 ms 4184 KB Output is correct
25 Correct 9 ms 596 KB Output is correct
26 Correct 7 ms 344 KB Output is correct
27 Correct 7 ms 344 KB Output is correct
28 Correct 8 ms 344 KB Output is correct
29 Correct 11 ms 344 KB Output is correct
30 Correct 14 ms 440 KB Output is correct
31 Correct 18 ms 696 KB Output is correct
32 Correct 18 ms 436 KB Output is correct
33 Correct 18 ms 1040 KB Output is correct
34 Correct 21 ms 600 KB Output is correct
35 Correct 20 ms 768 KB Output is correct
36 Correct 43 ms 3400 KB Output is correct
37 Correct 49 ms 2436 KB Output is correct
38 Correct 39 ms 2392 KB Output is correct
39 Correct 46 ms 3292 KB Output is correct
40 Correct 42 ms 2928 KB Output is correct
41 Correct 40 ms 3188 KB Output is correct
42 Correct 39 ms 2916 KB Output is correct
43 Correct 43 ms 3688 KB Output is correct
44 Correct 41 ms 2900 KB Output is correct
45 Correct 6 ms 344 KB Output is correct
46 Correct 8 ms 344 KB Output is correct
47 Correct 8 ms 344 KB Output is correct
48 Correct 6 ms 344 KB Output is correct
49 Correct 6 ms 344 KB Output is correct
50 Correct 15 ms 948 KB Output is correct
51 Correct 19 ms 592 KB Output is correct
52 Correct 19 ms 948 KB Output is correct
53 Correct 17 ms 1368 KB Output is correct
54 Correct 26 ms 1116 KB Output is correct
55 Correct 22 ms 1112 KB Output is correct
56 Correct 42 ms 3484 KB Output is correct
57 Correct 44 ms 2836 KB Output is correct
58 Correct 42 ms 2572 KB Output is correct
59 Correct 38 ms 2828 KB Output is correct
60 Correct 40 ms 3176 KB Output is correct
61 Correct 39 ms 2904 KB Output is correct
62 Correct 41 ms 3116 KB Output is correct
63 Correct 40 ms 2976 KB Output is correct
64 Correct 41 ms 2980 KB Output is correct

Subtask #4
0.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 344 KB Output is correct
2 Correct 7 ms 344 KB Output is correct
3 Correct 9 ms 344 KB Output is correct
4 Correct 17 ms 1368 KB Output is correct
5 Correct 28 ms 3416 KB Output is correct
6 Incorrect 1 ms 344 KB Incorrect
7 Halted 0 ms 0 KB -