oj.uz

답안 #961283

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
961283 2024-04-11T19:36:13 Z Prieved1 가장 긴 여행 (IOI23_longesttrip) C++17
30 / 100
 35 ms 3940 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> t[2];
  t[0].push_back(0);
  for(int i = 1;i<N;i++) {
    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<=400);
  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 1 ms 344 KB Output is correct
2 Correct 8 ms 3620 KB Output is correct

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 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 1624 KB Output is correct
5 Correct 25 ms 3672 KB Output is correct

Subtask #2
0.0 / 10.0

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

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 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 15 ms 1112 KB Output is correct
5 Correct 26 ms 3940 KB Output is correct
6 Correct 7 ms 344 KB Output is correct
7 Correct 7 ms 344 KB Output is correct
8 Correct 8 ms 344 KB Output is correct
9 Correct 12 ms 856 KB Output is correct
10 Correct 23 ms 3416 KB Output is correct
11 Correct 26 ms 3672 KB Output is correct
12 Correct 25 ms 3740 KB Output is correct
13 Correct 26 ms 3492 KB Output is correct
14 Correct 7 ms 344 KB Output is correct
15 Correct 9 ms 344 KB Output is correct
16 Correct 9 ms 344 KB Output is correct
17 Correct 9 ms 600 KB Output is correct
18 Correct 9 ms 600 KB Output is correct
19 Correct 14 ms 1508 KB Output is correct
20 Correct 14 ms 1180 KB Output is correct
21 Correct 32 ms 3444 KB Output is correct
22 Correct 26 ms 3452 KB Output is correct
23 Correct 27 ms 3100 KB Output is correct
24 Correct 27 ms 3452 KB Output is correct
25 Correct 8 ms 344 KB Output is correct
26 Correct 8 ms 344 KB Output is correct
27 Correct 9 ms 344 KB Output is correct
28 Correct 7 ms 344 KB Output is correct
29 Correct 6 ms 596 KB Output is correct
30 Correct 10 ms 580 KB Output is correct
31 Correct 13 ms 824 KB Output is correct
32 Correct 14 ms 856 KB Output is correct
33 Correct 18 ms 1112 KB Output is correct
34 Correct 15 ms 1112 KB Output is correct
35 Correct 17 ms 856 KB Output is correct
36 Correct 35 ms 3344 KB Output is correct
37 Correct 29 ms 3076 KB Output is correct
38 Correct 30 ms 2348 KB Output is correct
39 Correct 30 ms 2792 KB Output is correct
40 Correct 31 ms 3536 KB Output is correct
41 Correct 31 ms 2852 KB Output is correct
42 Correct 35 ms 3256 KB Output is correct
43 Correct 32 ms 2904 KB Output is correct
44 Correct 30 ms 2904 KB Output is correct
45 Correct 8 ms 344 KB Output is correct
46 Correct 6 ms 344 KB Output is correct
47 Correct 7 ms 344 KB Output is correct
48 Correct 7 ms 344 KB Output is correct
49 Correct 8 ms 344 KB Output is correct
50 Correct 11 ms 612 KB Output is correct
51 Correct 13 ms 572 KB Output is correct
52 Correct 12 ms 344 KB Output is correct
53 Correct 15 ms 1112 KB Output is correct
54 Correct 15 ms 1112 KB Output is correct
55 Correct 15 ms 1124 KB Output is correct
56 Correct 31 ms 3668 KB Output is correct
57 Correct 28 ms 2804 KB Output is correct
58 Correct 30 ms 2856 KB Output is correct
59 Correct 33 ms 2648 KB Output is correct
60 Correct 33 ms 2904 KB Output is correct
61 Correct 29 ms 2648 KB Output is correct
62 Correct 32 ms 3292 KB Output is correct
63 Correct 31 ms 3160 KB Output is correct
64 Correct 32 ms 3204 KB Output is correct

Subtask #4
0.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 344 KB Output is correct
2 Correct 7 ms 344 KB Output is correct
3 Correct 8 ms 344 KB Output is correct
4 Correct 13 ms 1144 KB Output is correct
5 Correct 25 ms 3264 KB Output is correct
6 Incorrect 1 ms 344 KB Incorrect
7 Halted 0 ms 0 KB -