oj.uz

답안 #961291

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
961291 2024-04-11T19:44:32 Z Prieved1 가장 긴 여행 (IOI23_longesttrip) C++17
5 / 100
 35 ms 4772 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]);
    }
    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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 9 ms 3108 KB Output is correct

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 344 KB Output is correct
2 Correct 6 ms 344 KB Output is correct
3 Correct 11 ms 340 KB Output is correct
4 Correct 15 ms 1368 KB Output is correct
5 Correct 33 ms 3672 KB Output is correct

Subtask #2
0.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 344 KB Output is correct
2 Correct 8 ms 600 KB Output is correct
3 Correct 8 ms 344 KB Output is correct
4 Correct 14 ms 1240 KB Output is correct
5 Correct 30 ms 3816 KB Output is correct
6 Incorrect 1 ms 344 KB Incorrect
7 Halted 0 ms 0 KB -

Subtask #3
0.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 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 15 ms 1524 KB Output is correct
5 Correct 29 ms 3928 KB Output is correct
6 Correct 8 ms 344 KB Output is correct
7 Correct 6 ms 344 KB Output is correct
8 Correct 9 ms 344 KB Output is correct
9 Correct 14 ms 856 KB Output is correct
10 Correct 27 ms 3928 KB Output is correct
11 Correct 26 ms 3740 KB Output is correct
12 Correct 25 ms 3416 KB Output is correct
13 Correct 27 ms 3584 KB Output is correct
14 Correct 6 ms 344 KB Output is correct
15 Correct 9 ms 344 KB Output is correct
16 Correct 8 ms 344 KB Output is correct
17 Correct 9 ms 600 KB Output is correct
18 Correct 10 ms 856 KB Output is correct
19 Correct 14 ms 1272 KB Output is correct
20 Correct 15 ms 600 KB Output is correct
21 Correct 33 ms 3580 KB Output is correct
22 Correct 29 ms 3376 KB Output is correct
23 Correct 28 ms 3440 KB Output is correct
24 Correct 28 ms 3424 KB Output is correct
25 Correct 6 ms 344 KB Output is correct
26 Correct 8 ms 344 KB Output is correct
27 Correct 6 ms 344 KB Output is correct
28 Correct 8 ms 344 KB Output is correct
29 Correct 8 ms 344 KB Output is correct
30 Correct 15 ms 592 KB Output is correct
31 Correct 13 ms 696 KB Output is correct
32 Correct 15 ms 600 KB Output is correct
33 Correct 18 ms 1356 KB Output is correct
34 Correct 16 ms 1224 KB Output is correct
35 Correct 16 ms 1112 KB Output is correct
36 Correct 34 ms 3636 KB Output is correct
37 Correct 35 ms 3224 KB Output is correct
38 Runtime error 25 ms 4772 KB Execution killed with signal 6
39 Halted 0 ms 0 KB -

Subtask #4
0.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 344 KB Output is correct
2 Correct 6 ms 344 KB Output is correct
3 Correct 8 ms 344 KB Output is correct
4 Correct 15 ms 1112 KB Output is correct
5 Correct 30 ms 3672 KB Output is correct
6 Incorrect 0 ms 340 KB Incorrect
7 Halted 0 ms 0 KB -