oj.uz

답안 #961661

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
961661 2024-04-12T09:45:09 Z Prieved1 가장 긴 여행 (IOI23_longesttrip) C++17
100 / 100
 39 ms 4364 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]);
  t[1].push_back(id[1]);
  bool connected=1;
  for(int ii = 2;ii<N;ii++) {
    int i=id[ii];
    if(t[0].size() < t[1].size())swap(t[0], t[1]);
    if(t[1].size()>0 and rand()%2) {
      swap(t[0], t[1]);
    }
    if(query2(i, t[0].back())) {
      t[0].push_back(i);
      connected=1;
    }
    else if(connected==false or query2(i, t[1].back())) {
      t[1].push_back(i);
      connected=false;
    }
    else {
      connected=1;
      while(t[1].size()) {
        t[0].push_back(t[1].back());
        t[1].pop_back();
      }
      t[1].push_back(i);
    }
  }
  assert(cnt<380);
  if(t[0].size()<t[1].size())swap(t[0], t[1]);
  if(t[1].size()==0)return t[0];
  if(query2(t[0][0], t[1].back())) {
    reverse(t[0].begin(), t[0].end());
    while(t[1].size()) {
      t[0].push_back(t[1].back());
      t[1].pop_back();
    }
    return t[0];
  }
  if(query2(t[0][0], t[1][0])) {
    reverse(t[0].begin(), t[0].end());
    reverse(t[1].begin(), t[1].end());
    while(t[1].size()) {
      t[0].push_back(t[1].back());
      t[1].pop_back();
    }
    return t[0];
  }
  if(query2(t[0].back(), t[1][0])) {
    reverse(t[1].begin(), t[1].end());
    while(t[1].size()) {
      t[0].push_back(t[1].back());
      t[1].pop_back();
    }
    return t[0];
  }
  if(are_connected(t[0], t[1])==false)return t[0];
  int lo = 0, hi = t[0].size()-1;
  int res=hi;
  while(lo <= hi) {
    int mid=(lo+hi)/2;
    vector<int> tmp;
    for(int j = 0;j<=mid;j++)tmp.push_back(t[0][j]);
    if(are_connected(tmp, t[1])) {
      res=mid;
      hi=mid-1;
    }
    else{
      lo=mid+1;
    }
  }
  lo=0, hi=t[1].size()-1;
  int res2=hi;
  while(lo <= hi) {
    int mid=(lo+hi)/2;
    vector<int> tmp;
    for(int j = 0;j<=mid;j++)tmp.push_back(t[1][j]);
    if(are_connected(tmp, {t[0][res]})) {
      res2=mid;
      hi=mid-1;
    }
    else{
      lo=mid+1;
    }
  }
  vector<int> ans;
  for(int j = res+1;j<t[0].size();j++) {
    ans.push_back(t[0][j]);
  }
  for(int j = 0;j<=res;j++)ans.push_back(t[0][j]);
  for(int j = res2;j<t[1].size();j++)ans.push_back(t[1][j]);
  for(int j = 0;j<res2;j++)ans.push_back(t[1][j]);
  return ans;
}

Compilation message

longesttrip.cpp: In function 'std::vector<int> longest_trip(int, int)':
longesttrip.cpp:120:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  120 |   for(int j = res+1;j<t[0].size();j++) {
      |                     ~^~~~~~~~~~~~
longesttrip.cpp:124:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  124 |   for(int j = res2;j<t[1].size();j++)ans.push_back(t[1][j]);
      |                    ~^~~~~~~~~~~~

Subtask #0
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 596 KB Output is correct
2 Correct 8 ms 3684 KB Output is correct

Subtask #1
5.0 / 5.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 18 ms 1196 KB Output is correct
5 Correct 27 ms 3824 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 344 KB Output is correct
2 Correct 6 ms 344 KB Output is correct
3 Correct 9 ms 344 KB Output is correct
4 Correct 16 ms 1624 KB Output is correct
5 Correct 26 ms 3516 KB Output is correct
6 Correct 8 ms 344 KB Output is correct
7 Correct 8 ms 344 KB Output is correct
8 Correct 10 ms 344 KB Output is correct
9 Correct 14 ms 856 KB Output is correct
10 Correct 26 ms 3928 KB Output is correct
11 Correct 26 ms 3672 KB Output is correct
12 Correct 27 ms 3928 KB Output is correct
13 Correct 29 ms 3464 KB Output is correct

Subtask #3
25.0 / 25.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 600 KB Output is correct
4 Correct 15 ms 1112 KB Output is correct
5 Correct 31 ms 3464 KB Output is correct
6 Correct 8 ms 344 KB Output is correct
7 Correct 6 ms 344 KB Output is correct
8 Correct 10 ms 344 KB Output is correct
9 Correct 14 ms 856 KB Output is correct
10 Correct 26 ms 3844 KB Output is correct
11 Correct 27 ms 3692 KB Output is correct
12 Correct 26 ms 3672 KB Output is correct
13 Correct 26 ms 3520 KB Output is correct
14 Correct 11 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 344 KB Output is correct
18 Correct 11 ms 344 KB Output is correct
19 Correct 17 ms 1368 KB Output is correct
20 Correct 14 ms 856 KB Output is correct
21 Correct 31 ms 3764 KB Output is correct
22 Correct 33 ms 3492 KB Output is correct
23 Correct 30 ms 3672 KB Output is correct
24 Correct 28 ms 3416 KB Output is correct
25 Correct 8 ms 344 KB Output is correct
26 Correct 12 ms 344 KB Output is correct
27 Correct 7 ms 344 KB Output is correct
28 Correct 7 ms 344 KB Output is correct
29 Correct 7 ms 344 KB Output is correct
30 Correct 14 ms 692 KB Output is correct
31 Correct 13 ms 692 KB Output is correct
32 Correct 14 ms 692 KB Output is correct
33 Correct 14 ms 856 KB Output is correct
34 Correct 17 ms 1112 KB Output is correct
35 Correct 15 ms 856 KB Output is correct
36 Correct 30 ms 3736 KB Output is correct
37 Correct 30 ms 3672 KB Output is correct
38 Correct 30 ms 3928 KB Output is correct
39 Correct 33 ms 3416 KB Output is correct
40 Correct 28 ms 3672 KB Output is correct
41 Correct 32 ms 3820 KB Output is correct
42 Correct 31 ms 4052 KB Output is correct
43 Correct 29 ms 3416 KB Output is correct
44 Correct 34 ms 3928 KB Output is correct
45 Correct 7 ms 344 KB Output is correct
46 Correct 7 ms 344 KB Output is correct
47 Correct 8 ms 344 KB Output is correct
48 Correct 9 ms 344 KB Output is correct
49 Correct 7 ms 344 KB Output is correct
50 Correct 13 ms 696 KB Output is correct
51 Correct 13 ms 440 KB Output is correct
52 Correct 13 ms 440 KB Output is correct
53 Correct 15 ms 856 KB Output is correct
54 Correct 16 ms 1112 KB Output is correct
55 Correct 20 ms 1152 KB Output is correct
56 Correct 29 ms 4068 KB Output is correct
57 Correct 30 ms 3728 KB Output is correct
58 Correct 30 ms 3564 KB Output is correct
59 Correct 32 ms 3756 KB Output is correct
60 Correct 33 ms 3932 KB Output is correct
61 Correct 31 ms 3984 KB Output is correct
62 Correct 31 ms 4016 KB Output is correct
63 Correct 32 ms 3856 KB Output is correct
64 Correct 32 ms 3920 KB Output is correct

Subtask #4
60.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 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 15 ms 1252 KB Output is correct
5 Correct 25 ms 3928 KB Output is correct
6 Correct 6 ms 344 KB Output is correct
7 Correct 6 ms 344 KB Output is correct
8 Correct 10 ms 344 KB Output is correct
9 Correct 14 ms 856 KB Output is correct
10 Correct 28 ms 4092 KB Output is correct
11 Correct 28 ms 3928 KB Output is correct
12 Correct 24 ms 3416 KB Output is correct
13 Correct 26 ms 3672 KB Output is correct
14 Correct 8 ms 344 KB Output is correct
15 Correct 8 ms 344 KB Output is correct
16 Correct 9 ms 504 KB Output is correct
17 Correct 12 ms 344 KB Output is correct
18 Correct 12 ms 500 KB Output is correct
19 Correct 14 ms 1112 KB Output is correct
20 Correct 13 ms 856 KB Output is correct
21 Correct 9 ms 344 KB Output is correct
22 Correct 9 ms 344 KB Output is correct
23 Correct 9 ms 344 KB Output is correct
24 Correct 8 ms 344 KB Output is correct
25 Correct 8 ms 344 KB Output is correct
26 Correct 12 ms 432 KB Output is correct
27 Correct 12 ms 696 KB Output is correct
28 Correct 16 ms 444 KB Output is correct
29 Correct 14 ms 856 KB Output is correct
30 Correct 14 ms 856 KB Output is correct
31 Correct 18 ms 856 KB Output is correct
32 Correct 9 ms 344 KB Output is correct
33 Correct 9 ms 344 KB Output is correct
34 Correct 9 ms 600 KB Output is correct
35 Correct 9 ms 344 KB Output is correct
36 Correct 8 ms 344 KB Output is correct
37 Correct 12 ms 444 KB Output is correct
38 Correct 16 ms 948 KB Output is correct
39 Correct 15 ms 696 KB Output is correct
40 Correct 15 ms 1112 KB Output is correct
41 Correct 18 ms 1112 KB Output is correct
42 Correct 15 ms 856 KB Output is correct
43 Correct 26 ms 3672 KB Output is correct
44 Correct 31 ms 3416 KB Output is correct
45 Correct 32 ms 3496 KB Output is correct
46 Correct 27 ms 3688 KB Output is correct
47 Correct 32 ms 4184 KB Output is correct
48 Correct 34 ms 3928 KB Output is correct
49 Correct 32 ms 3672 KB Output is correct
50 Correct 34 ms 4364 KB Output is correct
51 Correct 31 ms 3416 KB Output is correct
52 Correct 32 ms 3940 KB Output is correct
53 Correct 30 ms 3404 KB Output is correct
54 Correct 32 ms 3852 KB Output is correct
55 Correct 33 ms 3416 KB Output is correct
56 Correct 33 ms 3936 KB Output is correct
57 Correct 28 ms 3416 KB Output is correct
58 Correct 32 ms 3792 KB Output is correct
59 Correct 28 ms 3540 KB Output is correct
60 Correct 27 ms 3668 KB Output is correct
61 Correct 32 ms 3416 KB Output is correct
62 Correct 28 ms 3908 KB Output is correct
63 Correct 30 ms 3692 KB Output is correct
64 Correct 34 ms 3528 KB Output is correct
65 Correct 39 ms 3688 KB Output is correct
66 Correct 36 ms 3724 KB Output is correct
67 Correct 33 ms 3972 KB Output is correct
68 Correct 31 ms 3752 KB Output is correct
69 Correct 31 ms 4136 KB Output is correct
70 Correct 34 ms 3932 KB Output is correct
71 Correct 31 ms 3792 KB Output is correct
72 Correct 33 ms 4144 KB Output is correct
73 Correct 30 ms 3668 KB Output is correct
74 Correct 29 ms 3776 KB Output is correct
75 Correct 34 ms 3672 KB Output is correct
76 Correct 34 ms 3804 KB Output is correct
77 Correct 33 ms 3764 KB Output is correct
78 Correct 30 ms 3516 KB Output is correct
79 Correct 30 ms 3768 KB Output is correct
80 Correct 32 ms 3988 KB Output is correct
81 Correct 30 ms 3612 KB Output is correct
82 Correct 34 ms 3824 KB Output is correct