oj.uz

Submission #848922

# Submission time Handle Problem Language Result Execution time Memory
848922 2023-09-13T17:47:04 Z emad234 Longest Trip (IOI23_longesttrip) C++17
30 / 100
 12 ms 600 KB 
#include <bits/stdc++.h>
#define all(v) ((v).begin(),(v).end())
#define ll long long
#define F first
#define S second
const ll mod = 1e9 + 7;
const ll mxN = 2e5 + 1;
using namespace std;
bool are_connected(vector<int> A, vector<int> B);
int Search(vector<int>a,vector<int>b){
  if(b.size() == 1) return b[0];
  vector<int>v,v1;
  for(int i = 0;i < b.size() / 2;i++) v.push_back(b[i]);
  for(int i = b.size() / 2;i < b.size();i++) v1.push_back(b[i]);
  if(v.size() && are_connected(a,v)) return Search(a,v);
  else return Search(a,v1);
}
vector<int> longest_trip(int N, int D)
{
  vector<int>v = {0},v1;
  queue<int>q;
  for(int i = 1;i < N;i++)q.push(i);
  while(q.size()){
    int u = q.front();
    q.pop();
    bool x = (v.size() && are_connected({v[v.size() - 1]},{u})),y = (v1.size() &&  are_connected({v1[v1.size() - 1]},{u}));
    if(x && y){
      v.push_back(u);
      reverse(v1.begin(),v1.end());
      for(auto el : v1) v.push_back(el);
      v1.clear();
    }
    else if(x) v.push_back(u);
    else if(y) v1.push_back(u);
    else{
      reverse(v1.begin(),v1.end());
      for(auto el : v1) v.push_back(el);
      v1.clear();
      v1.push_back(u);
    }
  }
  // if(v.size() && v1.size() && are_connected(v,v1)){
  //   if(are_connected({v[0]},{v1[0]})){
  //     reverse(v.begin(),v.end());
  //     for(auto x : v1) v.push_back(x);
  //     return v;
  //   }
  //   else if(are_connected({v[v.size() - 1]},{v1[0]})){
  //     for(auto x : v1) v.push_back(x);
  //     return v;
  //   }else if(are_connected({v[0]},{v1[v1.size() - 1]})){
  //     reverse(v.begin(),v.end());
  //     reverse(v1.begin(),v1.end());
  //     for(auto x : v1) v.push_back(x);
  //     return v;
  //   }else if(are_connected({v[v.size() - 1]},{v1[v1.size() - 1]})){
  //     reverse(v1.begin(),v1.end());
  //     for(auto x : v1) v.push_back(x);
  //     return v;
  //   }
  //   int x = Search(v,v1);
  //   int y = Search({x},v);
  //   vector<int>ans;
  //   int id = 0;
  //   for(int i = 0;i < v.size();i++){
  //     if(v[i] == y) id = (i + 1) % v.size();
  //   }
  //   int id1;
  //   int bf;
  //   for(int i = 0;i < v1.size();i++){
  //     if(v1[(i + 1) % v1.size()] == x) {
  //       bf = i;
  //       id1 = (i + 1) % v1.size();
  //     }
  //   }
  //   while(v[id] != y){
  //     ans.push_back(v[id]);
  //     id++;
  //     id %= v.size();
  //   }
  //   while(id1 != bf){
  //     ans.push_back(v1[id1]);
  //     id1++;
  //     id1%= v1.size();
  //   }
  //   return ans;
  // }else{
    if(v.size() > v1.size()) return v;
    else return v1;
  // }
}

Compilation message

longesttrip.cpp: In function 'int Search(std::vector<int>, std::vector<int>)':
longesttrip.cpp:13:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   13 |   for(int i = 0;i < b.size() / 2;i++) v.push_back(b[i]);
      |                 ~~^~~~~~~~~~~~~~
longesttrip.cpp:14:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   14 |   for(int i = b.size() / 2;i < b.size();i++) v1.push_back(b[i]);
      |                            ~~^~~~~~~~~~

Subtask #0
0.0 / 0.0

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

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 596 KB Output is correct
2 Correct 5 ms 344 KB Output is correct
3 Correct 4 ms 344 KB Output is correct
4 Correct 4 ms 344 KB Output is correct
5 Correct 5 ms 344 KB Output is correct

Subtask #2
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 344 KB Output is correct
2 Correct 5 ms 344 KB Output is correct
3 Correct 4 ms 596 KB Output is correct
4 Correct 4 ms 344 KB Output is correct
5 Correct 4 ms 344 KB Output is correct
6 Incorrect 0 ms 344 KB Incorrect
7 Halted 0 ms 0 KB -

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 344 KB Output is correct
2 Correct 4 ms 344 KB Output is correct
3 Correct 4 ms 344 KB Output is correct
4 Correct 4 ms 344 KB Output is correct
5 Correct 5 ms 344 KB Output is correct
6 Correct 6 ms 344 KB Output is correct
7 Correct 5 ms 344 KB Output is correct
8 Correct 5 ms 344 KB Output is correct
9 Correct 4 ms 344 KB Output is correct
10 Correct 4 ms 344 KB Output is correct
11 Correct 4 ms 344 KB Output is correct
12 Correct 4 ms 344 KB Output is correct
13 Correct 4 ms 496 KB Output is correct
14 Correct 8 ms 344 KB Output is correct
15 Correct 7 ms 344 KB Output is correct
16 Correct 6 ms 344 KB Output is correct
17 Correct 6 ms 344 KB Output is correct
18 Correct 5 ms 344 KB Output is correct
19 Correct 6 ms 344 KB Output is correct
20 Correct 6 ms 344 KB Output is correct
21 Correct 5 ms 344 KB Output is correct
22 Correct 4 ms 600 KB Output is correct
23 Correct 5 ms 344 KB Output is correct
24 Correct 5 ms 344 KB Output is correct
25 Correct 6 ms 344 KB Output is correct
26 Correct 7 ms 344 KB Output is correct
27 Correct 6 ms 344 KB Output is correct
28 Correct 6 ms 344 KB Output is correct
29 Correct 9 ms 344 KB Output is correct
30 Correct 7 ms 344 KB Output is correct
31 Correct 8 ms 344 KB Output is correct
32 Correct 9 ms 344 KB Output is correct
33 Correct 8 ms 344 KB Output is correct
34 Correct 8 ms 344 KB Output is correct
35 Correct 9 ms 344 KB Output is correct
36 Correct 6 ms 344 KB Output is correct
37 Correct 8 ms 344 KB Output is correct
38 Correct 11 ms 600 KB Output is correct
39 Correct 8 ms 344 KB Output is correct
40 Correct 8 ms 544 KB Output is correct
41 Correct 9 ms 600 KB Output is correct
42 Correct 9 ms 344 KB Output is correct
43 Correct 9 ms 344 KB Output is correct
44 Correct 10 ms 600 KB Output is correct
45 Correct 6 ms 344 KB Output is correct
46 Correct 7 ms 344 KB Output is correct
47 Correct 6 ms 344 KB Output is correct
48 Correct 6 ms 344 KB Output is correct
49 Correct 6 ms 344 KB Output is correct
50 Correct 6 ms 344 KB Output is correct
51 Correct 8 ms 344 KB Output is correct
52 Correct 8 ms 344 KB Output is correct
53 Correct 8 ms 600 KB Output is correct
54 Correct 8 ms 344 KB Output is correct
55 Correct 7 ms 600 KB Output is correct
56 Correct 5 ms 344 KB Output is correct
57 Correct 12 ms 600 KB Output is correct
58 Correct 9 ms 344 KB Output is correct
59 Correct 9 ms 344 KB Output is correct
60 Correct 9 ms 600 KB Output is correct
61 Correct 11 ms 344 KB Output is correct
62 Correct 9 ms 344 KB Output is correct
63 Correct 9 ms 344 KB Output is correct
64 Correct 8 ms 344 KB Output is correct

Subtask #4
0.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 344 KB Output is correct
2 Correct 4 ms 344 KB Output is correct
3 Correct 4 ms 596 KB Output is correct
4 Correct 4 ms 344 KB Output is correct
5 Correct 4 ms 344 KB Output is correct
6 Incorrect 0 ms 344 KB Incorrect
7 Halted 0 ms 0 KB -