oj.uz

Submission #961316

# Submission time Handle Problem Language Result Execution time Memory
961316 2024-04-11T20:00:13 Z Prieved1 Longest Trip (IOI23_longesttrip) C++17
5 / 100
 39 ms 6672 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 _ = 0;_<100;_++) {
    int i = rand()%(n-1)+1;
    int j  = rand()%i;
    query2(id[i], id[j]);
  }
  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]);
    }
    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 344 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 344 KB Output is correct
2 Correct 25 ms 344 KB Output is correct
3 Correct 26 ms 344 KB Output is correct
4 Correct 24 ms 1368 KB Output is correct
5 Correct 38 ms 3768 KB Output is correct

Subtask #2
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 344 KB Output is correct
2 Correct 20 ms 344 KB Output is correct
3 Correct 24 ms 600 KB Output is correct
4 Correct 26 ms 1112 KB Output is correct
5 Correct 39 ms 3364 KB Output is correct
6 Incorrect 0 ms 344 KB Incorrect
7 Halted 0 ms 0 KB -

Subtask #3
0.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 344 KB Output is correct
2 Correct 20 ms 344 KB Output is correct
3 Correct 22 ms 344 KB Output is correct
4 Correct 24 ms 1112 KB Output is correct
5 Correct 37 ms 3812 KB Output is correct
6 Correct 10 ms 540 KB Output is correct
7 Correct 20 ms 344 KB Output is correct
8 Correct 24 ms 344 KB Output is correct
9 Correct 25 ms 1376 KB Output is correct
10 Correct 35 ms 3416 KB Output is correct
11 Correct 37 ms 3608 KB Output is correct
12 Correct 36 ms 3992 KB Output is correct
13 Correct 32 ms 3924 KB Output is correct
14 Correct 8 ms 344 KB Output is correct
15 Correct 19 ms 344 KB Output is correct
16 Correct 28 ms 344 KB Output is correct
17 Correct 23 ms 600 KB Output is correct
18 Correct 26 ms 344 KB Output is correct
19 Correct 26 ms 1116 KB Output is correct
20 Correct 30 ms 1300 KB Output is correct
21 Runtime error 12 ms 6672 KB Execution killed with signal 6
22 Halted 0 ms 0 KB -

Subtask #4
0.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 344 KB Output is correct
2 Correct 23 ms 344 KB Output is correct
3 Correct 22 ms 344 KB Output is correct
4 Correct 28 ms 1684 KB Output is correct
5 Correct 35 ms 3928 KB Output is correct
6 Incorrect 0 ms 344 KB Incorrect
7 Halted 0 ms 0 KB -