oj.uz

Submission #897067

# Submission time Handle Problem Language Result Execution time Memory
897067 2024-01-02T13:51:43 Z irmuun Longest Trip (IOI23_longesttrip) C++17
15 / 100
 9 ms 864 KB 
#include<bits/stdc++.h>
#include "longesttrip.h"
 
using namespace std;
 
#define ll long long
#define pb push_back
#define ff first
#define ss second
#define all(s) s.begin(),s.end()
#define rall(s) s.rbegin(),s.rend()
 
vector<int>longest_trip(int N, int D){
    vector<int>ans;
    if(D==3){
        vector<int>ans(N);
        iota(all(ans),0);
        return ans;
    }
    if(D==2){
        vector<int>ans;
        ans.pb(0);
        int l=0,r=0;
        int x;
        for(int i=1;i<N;i++){
            if(are_connected({0},{i})==true){
                ans.pb(i);
                x=i;
                r=i;
                break;
            }
        }
        for(int i=1;i<N;i++){
            if(i!=x){
                if(are_connected({l},{i})){
                    ans.insert(ans.begin(),i);
                    l=i;
                }
                else{
                    ans.pb(i);
                    r=i;
                }
            }
        }
        return ans;
    }
    vector<int>v,u;
    v.pb(0);
    u.pb(1);
    for(int i=2;i<N;i++){
        if(are_connected({v.back()},{i})==true){
            v.pb(i);
        }
        else if(are_connected({u.back()},{i})==true){
            u.pb(i);
        }
        else{
            reverse(all(u));
            v.insert(v.end(),all(u));
            u={i};
        }
    }
    if(are_connected(v,u)==false){
        if(v.size()>=u.size()){
            return v;
        }
        return u;
    }
    //now need combine 2 cycles
    if(v.size()>=2&&u.size()>=2){
        if(are_connected({v[0],v.back()},{u[0],u.back()})==true){
            if(are_connected({v[0]},{u[0]})){
                reverse(all(v));
                v.insert(v.end(),all(u));
            }
            else if(are_connected({v[0]},{u.back()})){
                reverse(all(v));
                reverse(all(u));
                v.insert(v.end(),all(u));
            }
            else if(are_connected({v.back()},{u[0]})){
                v.insert(v.end(),all(u));
            }
            else if(are_connected({v.back()},{u.back()})){
                reverse(all(u));
                v.insert(v.end(),all(u));
            }
            return v;
        }
    }
    vector<int>v1=v,u1=u;
    while(v1.size()>1){
        vector<int>l,r;
        for(int i=0;i<v1.size()/2;i++){
            l.pb(v1[i]);
        }
        for(int i=v1.size()/2;i<v1.size();i++){
            r.pb(v1[i]);
        }
        if(are_connected(l,u1)==true){
            v1=l;
        }
        else{
            v1=r;
        }
    }
    while(u1.size()>1){
        vector<int>l,r;
        for(int i=0;i<u1.size()/2;i++){
            l.pb(u1[i]);
        }
        for(int i=u1.size()/2;i<u1.size();i++){
            r.pb(u1[i]);
        }
        if(are_connected(v1,l)==true){
            u1=l;
        }
        else{
            u1=r;
        }
    }
    for(int i=0;i<v.size();i++){
        if(v[i]==v1[0]){
            rotate(v.begin(),v.begin()+i,v.end());
            break;
        }
    }
    for(int i=0;i<u.size();i++){
        if(u[i]==u1[0]){
            rotate(u.begin(),u.begin()+i,u.end());
            break;
        }
    }
    reverse(all(v));
    v.insert(v.end(),all(u));
    return v;
}

Compilation message

longesttrip.cpp: In function 'std::vector<int> longest_trip(int, int)':
longesttrip.cpp:23:17: warning: variable 'r' set but not used [-Wunused-but-set-variable]
   23 |         int l=0,r=0;
      |                 ^
longesttrip.cpp:94:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   94 |         for(int i=0;i<v1.size()/2;i++){
      |                     ~^~~~~~~~~~~~
longesttrip.cpp:97:32: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   97 |         for(int i=v1.size()/2;i<v1.size();i++){
      |                               ~^~~~~~~~~~
longesttrip.cpp:109:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  109 |         for(int i=0;i<u1.size()/2;i++){
      |                     ~^~~~~~~~~~~~
longesttrip.cpp:112:32: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  112 |         for(int i=u1.size()/2;i<u1.size();i++){
      |                               ~^~~~~~~~~~
longesttrip.cpp:122:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  122 |     for(int i=0;i<v.size();i++){
      |                 ~^~~~~~~~~
longesttrip.cpp:128:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  128 |     for(int i=0;i<u.size();i++){
      |                 ~^~~~~~~~~
longesttrip.cpp:34:13: warning: 'x' may be used uninitialized in this function [-Wmaybe-uninitialized]
   34 |             if(i!=x){
      |             ^~

Subtask #0
0.0 / 0.0

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

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.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 344 KB Output is correct
4 Correct 5 ms 344 KB Output is correct
5 Correct 5 ms 600 KB Output is correct
6 Correct 6 ms 344 KB Output is correct
7 Correct 4 ms 344 KB Output is correct
8 Correct 5 ms 344 KB Output is correct
9 Correct 5 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 5 ms 344 KB Output is correct
13 Correct 6 ms 600 KB Output is correct

Subtask #3
0.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 344 KB Output is correct
2 Correct 7 ms 344 KB Output is correct
3 Correct 5 ms 344 KB Output is correct
4 Correct 5 ms 600 KB Output is correct
5 Correct 5 ms 544 KB Output is correct
6 Correct 9 ms 344 KB Output is correct
7 Correct 7 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 436 KB Output is correct
11 Correct 4 ms 440 KB Output is correct
12 Correct 4 ms 344 KB Output is correct
13 Correct 5 ms 604 KB Output is correct
14 Correct 6 ms 344 KB Output is correct
15 Correct 7 ms 344 KB Output is correct
16 Correct 7 ms 344 KB Output is correct
17 Correct 7 ms 600 KB Output is correct
18 Correct 6 ms 344 KB Output is correct
19 Correct 6 ms 856 KB Output is correct
20 Correct 6 ms 344 KB Output is correct
21 Correct 7 ms 600 KB Output is correct
22 Correct 5 ms 596 KB Output is correct
23 Correct 6 ms 864 KB Output is correct
24 Correct 5 ms 692 KB Output is correct
25 Correct 8 ms 344 KB Output is correct
26 Correct 6 ms 344 KB Output is correct
27 Correct 5 ms 344 KB Output is correct
28 Correct 5 ms 344 KB Output is correct
29 Correct 6 ms 344 KB Output is correct
30 Correct 5 ms 344 KB Output is correct
31 Correct 6 ms 600 KB Output is correct
32 Correct 6 ms 344 KB Output is correct
33 Correct 5 ms 600 KB Output is correct
34 Correct 4 ms 344 KB Output is correct
35 Correct 5 ms 344 KB Output is correct
36 Correct 4 ms 344 KB Output is correct
37 Correct 5 ms 344 KB Output is correct
38 Correct 5 ms 344 KB Output is correct
39 Correct 8 ms 600 KB Output is correct
40 Correct 7 ms 600 KB Output is correct
41 Correct 6 ms 344 KB Output is correct
42 Correct 6 ms 344 KB Output is correct
43 Correct 7 ms 344 KB Output is correct
44 Correct 6 ms 344 KB Output is correct
45 Incorrect 1 ms 344 KB Incorrect
46 Halted 0 ms 0 KB -

Subtask #4
0.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 344 KB Output is correct
2 Correct 7 ms 344 KB Output is correct
3 Correct 5 ms 344 KB Output is correct
4 Correct 5 ms 600 KB Output is correct
5 Correct 5 ms 344 KB Output is correct
6 Correct 7 ms 344 KB Output is correct
7 Correct 6 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 604 KB Output is correct
11 Correct 5 ms 444 KB Output is correct
12 Correct 6 ms 600 KB Output is correct
13 Correct 5 ms 440 KB Output is correct
14 Correct 7 ms 344 KB Output is correct
15 Correct 7 ms 344 KB Output is correct
16 Correct 8 ms 344 KB Output is correct
17 Correct 8 ms 436 KB Output is correct
18 Correct 6 ms 600 KB Output is correct
19 Correct 5 ms 600 KB Output is correct
20 Correct 6 ms 600 KB Output is correct
21 Correct 6 ms 344 KB Output is correct
22 Correct 7 ms 344 KB Output is correct
23 Correct 5 ms 344 KB Output is correct
24 Correct 7 ms 344 KB Output is correct
25 Correct 5 ms 344 KB Output is correct
26 Correct 4 ms 344 KB Output is correct
27 Correct 6 ms 344 KB Output is correct
28 Correct 7 ms 344 KB Output is correct
29 Correct 5 ms 344 KB Output is correct
30 Correct 4 ms 344 KB Output is correct
31 Correct 5 ms 600 KB Output is correct
32 Incorrect 0 ms 344 KB Incorrect
33 Halted 0 ms 0 KB -