oj.uz

Submission #960201

# Submission time Handle Problem Language Result Execution time Memory
960201 2024-04-09T21:17:54 Z tutis Longest Trip (IOI23_longesttrip) C++17
15 / 100
 1000 ms 3812 KB 
#include "longesttrip.h"
#include <bits/stdc++.h>
using namespace std;
mt19937_64 rng(15645869);
 
std::vector<int> longest_trip(int N, int D)
{
    vector<int>x, y;
    vector<int>p;
    for(int i=0;i<N;i++){
        p.push_back(i);
    }
    set<pair<int,int>>yes;
    set<pair<int,int>>no;
    auto conn = [&](vector<int>x,vector<int>y) -> bool {
        int c1=0;
        for(int a: x){
            for(int b: y){
                if(yes.count({a,b})){
                    return true;
                }
                c1 += no.count({a,b});
            }
        }
        if(c1==x.size()*y.size()){
            return false;
        }
        bool ans = are_connected(x,y);
        if(!ans){
            for(int a: x){
                for(int b: y){
                    no.insert({a,b});
                    for(int c=0;c<N;c++){
                        if(no.count({a,c}) && c!=a && c!=b){
                            yes.insert({b,c});
                            yes.insert({c,b});
                        }
                        if(no.count({b,c}) && c!=a && c!=b){
                            yes.insert({a,c});
                            yes.insert({c,a});
                        }
                    }
                }
            }
        }
        if(ans && x.size()==1 && y.size()==1){
            yes.insert({x[0], y[0]});
            yes.insert({y[0], x[0]});
        }
        return ans;
    };
    auto fix=[&](){
        if(x.size()==0 || y.size()==0){
            return;
        }
        for(int a: x){
            for(int b: x){
                yes.insert({a,b});
                yes.insert({b,a});
            }
        }
        for(int a: y){
            for(int b: y){
                yes.insert({a,b});
                yes.insert({b,a});
            }
        }
    };
    shuffle(p.begin(),p.end(),rng);
    while(!p.empty()){
        int i=p.back();
        p.pop_back();
        if(x.size()==0){
            x={i};
            continue;
        }
        if(y.size()==0){
            if(conn({i}, {x[0]})){
                x.insert(x.begin(),i);
                continue;
            }
            if (conn({i}, {x.back()})){
                x.push_back(i);
                continue;
            }
            if(!conn({i}, x)){
                y={i};
                fix();
                continue;
            }
            int lo=1;
            int hi=x.size()-2;
            while(lo<hi){
                int m=(lo+hi)/2;
                vector<int>z;
                for(int i=lo;i<=m;i++){
                    z.push_back(x[i]);
                }
                if(conn(z, {i})){
                    hi=m;
                } else{
                    lo=m+1;
                }
            }
            vector<int>z;
            for(int i=lo+1;i<x.size();i++){
                z.push_back(x[i]);
            }
            for(int i=0;i<=lo;i++){
                z.push_back(x[i]);
            }
            z.push_back(i);
            x=z;
            continue;
        }
        if(!conn(x,{i})){
            y.push_back(i);
            fix();
            continue;
        }
        if(!conn(y,{i})){
            x.push_back(i);
            fix();
            continue;
        }
        int i0=0;
        int j0=0;
        if(!conn({x[0]},{i})){
            int lo=1;
            int hi=x.size()-1;
            while(lo<hi){
                int m=(lo+hi)/2;
                vector<int>z;
                for(int i=lo;i<=m;i++){
                    z.push_back(x[i]);
                }
                if(are_connected(z, {i})){
                    hi=m;
                } else{
                    lo=m+1;
                }
            }
            i0=lo;
        } else {
            int lo=0;
            int hi=y.size()-1;
            while(lo<hi){
                int m=(lo+hi)/2;
                vector<int>z;
                for(int i=lo;i<=m;i++){
                    z.push_back(y[i]);
                }
                if(are_connected(z, {i})){
                    hi=m;
                } else{
                    lo=m+1;
                }
            }
            j0=lo;
        }
        swap(x[i0], x.back());
        swap(y[j0], y[0]);
        x.push_back(i);
        for(int i: y){
            x.push_back(i);
        }
        y={};
    }
    if(x.size()>y.size()){
        return x;
    } else{
        return y;
    }
}

Compilation message

longesttrip.cpp: In lambda function:
longesttrip.cpp:25:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   25 |         if(c1==x.size()*y.size()){
      |            ~~^~~~~~~~~~~~~~~~~~~
longesttrip.cpp: In function 'std::vector<int> longest_trip(int, int)':
longesttrip.cpp:106:29: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  106 |             for(int i=lo+1;i<x.size();i++){
      |                            ~^~~~~~~~~

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 344 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 6 ms 344 KB Output is correct
3 Correct 5 ms 340 KB Output is correct
4 Correct 5 ms 348 KB Output is correct
5 Correct 8 ms 856 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 5 ms 344 KB Output is correct
3 Correct 5 ms 344 KB Output is correct
4 Correct 5 ms 344 KB Output is correct
5 Correct 5 ms 344 KB Output is correct
6 Correct 8 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 5 ms 344 KB Output is correct
10 Correct 6 ms 344 KB Output is correct
11 Correct 5 ms 612 KB Output is correct
12 Correct 5 ms 344 KB Output is correct
13 Correct 5 ms 344 KB Output is correct

Subtask #3
0.0 / 25.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 5 ms 344 KB Output is correct
4 Correct 6 ms 344 KB Output is correct
5 Correct 5 ms 704 KB Output is correct
6 Correct 7 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 5 ms 344 KB Output is correct
10 Correct 5 ms 344 KB Output is correct
11 Correct 5 ms 344 KB Output is correct
12 Correct 5 ms 600 KB Output is correct
13 Correct 5 ms 344 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 344 KB Output is correct
17 Correct 7 ms 344 KB Output is correct
18 Correct 7 ms 444 KB Output is correct
19 Correct 7 ms 604 KB Output is correct
20 Correct 6 ms 344 KB Output is correct
21 Correct 6 ms 860 KB Output is correct
22 Correct 7 ms 476 KB Output is correct
23 Correct 6 ms 724 KB Output is correct
24 Correct 7 ms 636 KB Output is correct
25 Correct 7 ms 344 KB Output is correct
26 Correct 7 ms 596 KB Output is correct
27 Correct 12 ms 344 KB Output is correct
28 Correct 11 ms 344 KB Output is correct
29 Correct 12 ms 344 KB Output is correct
30 Correct 156 ms 696 KB Output is correct
31 Correct 189 ms 732 KB Output is correct
32 Correct 169 ms 692 KB Output is correct
33 Correct 437 ms 888 KB Output is correct
34 Correct 573 ms 1164 KB Output is correct
35 Correct 555 ms 1140 KB Output is correct
36 Execution timed out 3059 ms 3812 KB Time limit exceeded
37 Halted 0 ms 0 KB -

Subtask #4
0.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 344 KB Output is correct
2 Correct 5 ms 344 KB Output is correct
3 Correct 5 ms 344 KB Output is correct
4 Correct 5 ms 356 KB Output is correct
5 Correct 5 ms 344 KB Output is correct
6 Correct 6 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 5 ms 344 KB Output is correct
10 Correct 5 ms 344 KB Output is correct
11 Correct 5 ms 344 KB Output is correct
12 Correct 5 ms 344 KB Output is correct
13 Correct 7 ms 600 KB Output is correct
14 Correct 7 ms 344 KB Output is correct
15 Correct 8 ms 344 KB Output is correct
16 Correct 7 ms 344 KB Output is correct
17 Correct 9 ms 344 KB Output is correct
18 Correct 7 ms 600 KB Output is correct
19 Correct 8 ms 456 KB Output is correct
20 Correct 8 ms 856 KB Output is correct
21 Correct 8 ms 344 KB Output is correct
22 Correct 7 ms 344 KB Output is correct
23 Correct 12 ms 344 KB Output is correct
24 Correct 15 ms 344 KB Output is correct
25 Correct 11 ms 344 KB Output is correct
26 Correct 159 ms 696 KB Output is correct
27 Correct 184 ms 436 KB Output is correct
28 Correct 176 ms 440 KB Output is correct
29 Correct 429 ms 1360 KB Output is correct
30 Correct 576 ms 1348 KB Output is correct
31 Correct 558 ms 740 KB Output is correct
32 Correct 8 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 8 ms 344 KB Output is correct
36 Correct 8 ms 344 KB Output is correct
37 Correct 45 ms 440 KB Output is correct
38 Correct 63 ms 1208 KB Output is correct
39 Correct 84 ms 952 KB Output is correct
40 Correct 41 ms 856 KB Output is correct
41 Correct 243 ms 948 KB Output is correct
42 Correct 97 ms 1368 KB Output is correct
43 Correct 6 ms 860 KB Output is correct
44 Correct 6 ms 604 KB Output is correct
45 Correct 7 ms 976 KB Output is correct
46 Correct 8 ms 612 KB Output is correct
47 Execution timed out 3010 ms 3660 KB Time limit exceeded
48 Halted 0 ms 0 KB -