oj.uz

Submission #961323

# Submission time Handle Problem Language Result Execution time Memory
961323 2024-04-11T20:11:34 Z Prieved1 Longest Trip (IOI23_longesttrip) C++17
85 / 100
 51 ms 4220 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();
          }
        }
      }
    }
  }
  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:117:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  117 |   for(int j = res+1;j<t[0].size();j++) {
      |                     ~^~~~~~~~~~~~
longesttrip.cpp:121:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  121 |   for(int j = res2;j<t[1].size();j++)ans.push_back(t[1][j]);
      |                    ~^~~~~~~~~~~~

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 8 ms 3160 KB Output is correct

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 6 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 18 ms 1112 KB Output is correct
5 Correct 30 ms 3672 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 340 KB Output is correct
2 Correct 5 ms 344 KB Output is correct
3 Correct 10 ms 344 KB Output is correct
4 Correct 18 ms 1368 KB Output is correct
5 Correct 28 ms 3672 KB Output is correct
6 Correct 11 ms 344 KB Output is correct
7 Correct 7 ms 344 KB Output is correct
8 Correct 9 ms 600 KB Output is correct
9 Correct 12 ms 1112 KB Output is correct
10 Correct 27 ms 3416 KB Output is correct
11 Correct 32 ms 3976 KB Output is correct
12 Correct 26 ms 3764 KB Output is correct
13 Correct 30 ms 3672 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 6 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 17 ms 1624 KB Output is correct
5 Correct 32 ms 3672 KB Output is correct
6 Correct 9 ms 344 KB Output is correct
7 Correct 6 ms 344 KB Output is correct
8 Correct 11 ms 548 KB Output is correct
9 Correct 13 ms 1112 KB Output is correct
10 Correct 27 ms 3672 KB Output is correct
11 Correct 27 ms 3928 KB Output is correct
12 Correct 31 ms 4220 KB Output is correct
13 Correct 32 ms 3416 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 12 ms 856 KB Output is correct
18 Correct 13 ms 696 KB Output is correct
19 Correct 16 ms 1256 KB Output is correct
20 Correct 15 ms 1112 KB Output is correct
21 Correct 29 ms 3388 KB Output is correct
22 Correct 31 ms 3600 KB Output is correct
23 Correct 32 ms 3476 KB Output is correct
24 Correct 31 ms 3656 KB Output is correct
25 Correct 8 ms 344 KB Output is correct
26 Correct 15 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 9 ms 344 KB Output is correct
30 Correct 15 ms 620 KB Output is correct
31 Correct 15 ms 696 KB Output is correct
32 Correct 15 ms 948 KB Output is correct
33 Correct 18 ms 848 KB Output is correct
34 Correct 19 ms 856 KB Output is correct
35 Correct 17 ms 1052 KB Output is correct
36 Correct 51 ms 3232 KB Output is correct
37 Correct 32 ms 2584 KB Output is correct
38 Correct 33 ms 2916 KB Output is correct
39 Correct 34 ms 3308 KB Output is correct
40 Correct 33 ms 2904 KB Output is correct
41 Correct 41 ms 2904 KB Output is correct
42 Correct 36 ms 3160 KB Output is correct
43 Correct 36 ms 3416 KB Output is correct
44 Correct 39 ms 2972 KB Output is correct
45 Correct 8 ms 344 KB Output is correct
46 Correct 9 ms 340 KB Output is correct
47 Correct 8 ms 344 KB Output is correct
48 Correct 8 ms 344 KB Output is correct
49 Correct 9 ms 344 KB Output is correct
50 Correct 14 ms 436 KB Output is correct
51 Correct 15 ms 696 KB Output is correct
52 Correct 16 ms 692 KB Output is correct
53 Correct 22 ms 1368 KB Output is correct
54 Correct 19 ms 872 KB Output is correct
55 Correct 20 ms 632 KB Output is correct
56 Correct 37 ms 3164 KB Output is correct
57 Correct 35 ms 2828 KB Output is correct
58 Correct 35 ms 2844 KB Output is correct
59 Correct 35 ms 3488 KB Output is correct
60 Correct 40 ms 3280 KB Output is correct
61 Correct 37 ms 3136 KB Output is correct
62 Correct 39 ms 3156 KB Output is correct
63 Correct 37 ms 3208 KB Output is correct
64 Correct 39 ms 3296 KB Output is correct

Subtask #4
45.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 6 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 17 ms 1624 KB Output is correct
5 Correct 28 ms 3684 KB Output is correct
6 Correct 9 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 1008 KB Output is correct
10 Correct 31 ms 3672 KB Output is correct
11 Correct 31 ms 3988 KB Output is correct
12 Correct 32 ms 3724 KB Output is correct
13 Correct 28 ms 3952 KB Output is correct
14 Correct 9 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 10 ms 600 KB Output is correct
19 Correct 16 ms 864 KB Output is correct
20 Correct 17 ms 1252 KB Output is correct
21 Correct 9 ms 344 KB Output is correct
22 Correct 11 ms 340 KB Output is correct
23 Correct 9 ms 344 KB Output is correct
24 Correct 14 ms 344 KB Output is correct
25 Correct 9 ms 344 KB Output is correct
26 Correct 13 ms 704 KB Output is correct
27 Correct 15 ms 728 KB Output is correct
28 Correct 14 ms 1240 KB Output is correct
29 Correct 17 ms 908 KB Output is correct
30 Correct 18 ms 600 KB Output is correct
31 Correct 16 ms 1140 KB Output is correct
32 Correct 8 ms 344 KB Output is correct
33 Correct 9 ms 344 KB Output is correct
34 Correct 7 ms 344 KB Output is correct
35 Correct 9 ms 344 KB Output is correct
36 Correct 8 ms 344 KB Output is correct
37 Correct 15 ms 588 KB Output is correct
38 Correct 15 ms 956 KB Output is correct
39 Correct 16 ms 604 KB Output is correct
40 Correct 15 ms 856 KB Output is correct
41 Correct 21 ms 856 KB Output is correct
42 Correct 20 ms 1532 KB Output is correct
43 Correct 28 ms 3532 KB Output is correct
44 Correct 28 ms 3560 KB Output is correct
45 Correct 28 ms 3296 KB Output is correct
46 Correct 31 ms 3464 KB Output is correct
47 Correct 40 ms 3712 KB Output is correct
48 Correct 36 ms 2792 KB Output is correct
49 Correct 34 ms 2984 KB Output is correct
50 Correct 32 ms 2964 KB Output is correct
51 Correct 32 ms 2936 KB Output is correct
52 Correct 37 ms 2756 KB Output is correct
53 Correct 31 ms 2912 KB Output is correct
54 Correct 31 ms 3160 KB Output is correct
55 Correct 34 ms 2832 KB Output is correct
56 Correct 32 ms 2708 KB Output is correct
57 Correct 35 ms 3080 KB Output is correct
58 Correct 35 ms 2996 KB Output is correct
59 Partially correct 38 ms 3400 KB Output is partially correct
60 Correct 32 ms 2688 KB Output is correct
61 Correct 34 ms 3312 KB Output is correct
62 Correct 32 ms 3672 KB Output is correct
63 Correct 31 ms 2920 KB Output is correct
64 Correct 31 ms 2768 KB Output is correct
65 Partially correct 38 ms 3044 KB Output is partially correct
66 Partially correct 33 ms 2936 KB Output is partially correct
67 Partially correct 35 ms 3020 KB Output is partially correct
68 Partially correct 34 ms 3264 KB Output is partially correct
69 Correct 36 ms 2900 KB Output is correct
70 Partially correct 36 ms 3388 KB Output is partially correct
71 Partially correct 32 ms 2740 KB Output is partially correct
72 Correct 34 ms 2904 KB Output is correct
73 Partially correct 34 ms 3120 KB Output is partially correct
74 Correct 34 ms 3196 KB Output is correct
75 Partially correct 39 ms 3316 KB Output is partially correct
76 Partially correct 33 ms 3016 KB Output is partially correct
77 Correct 34 ms 3312 KB Output is correct
78 Partially correct 36 ms 2956 KB Output is partially correct
79 Partially correct 35 ms 2760 KB Output is partially correct
80 Partially correct 34 ms 3300 KB Output is partially correct
81 Partially correct 36 ms 2868 KB Output is partially correct
82 Correct 36 ms 3272 KB Output is correct