oj.uz

답안 #961285

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
961285 2024-04-11T19:37:44 Z Prieved1 가장 긴 여행 (IOI23_longesttrip) C++17
5 / 100
 36 ms 4996 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 Incorrect 1 ms 344 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 344 KB Output is correct
2 Correct 6 ms 344 KB Output is correct
3 Correct 11 ms 344 KB Output is correct
4 Correct 19 ms 1112 KB Output is correct
5 Correct 26 ms 3672 KB Output is correct

Subtask #2
0.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 344 KB Output is correct
2 Correct 7 ms 500 KB Output is correct
3 Correct 9 ms 600 KB Output is correct
4 Correct 19 ms 1368 KB Output is correct
5 Correct 29 ms 3804 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 6 ms 344 KB Output is correct
2 Correct 5 ms 344 KB Output is correct
3 Correct 9 ms 344 KB Output is correct
4 Correct 18 ms 1624 KB Output is correct
5 Correct 30 ms 4184 KB Output is correct
6 Correct 8 ms 344 KB Output is correct
7 Correct 7 ms 344 KB Output is correct
8 Correct 10 ms 344 KB Output is correct
9 Correct 14 ms 1112 KB Output is correct
10 Correct 25 ms 3672 KB Output is correct
11 Correct 26 ms 3416 KB Output is correct
12 Correct 27 ms 3924 KB Output is correct
13 Correct 28 ms 3868 KB Output is correct
14 Correct 8 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 11 ms 472 KB Output is correct
18 Correct 12 ms 592 KB Output is correct
19 Correct 17 ms 1116 KB Output is correct
20 Correct 15 ms 1068 KB Output is correct
21 Correct 30 ms 3160 KB Output is correct
22 Correct 31 ms 3160 KB Output is correct
23 Correct 27 ms 3168 KB Output is correct
24 Correct 29 ms 3448 KB Output is correct
25 Correct 7 ms 344 KB Output is correct
26 Correct 11 ms 344 KB Output is correct
27 Correct 8 ms 344 KB Output is correct
28 Correct 7 ms 344 KB Output is correct
29 Correct 9 ms 500 KB Output is correct
30 Correct 14 ms 1208 KB Output is correct
31 Correct 13 ms 440 KB Output is correct
32 Correct 15 ms 1204 KB Output is correct
33 Correct 18 ms 1368 KB Output is correct
34 Correct 19 ms 1112 KB Output is correct
35 Correct 20 ms 760 KB Output is correct
36 Correct 30 ms 3416 KB Output is correct
37 Correct 35 ms 2188 KB Output is correct
38 Correct 29 ms 2568 KB Output is correct
39 Runtime error 36 ms 4996 KB Execution killed with signal 6
40 Halted 0 ms 0 KB -

Subtask #4
0.0 / 60.0

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