oj.uz

답안 #960203

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
960203 2024-04-09T21:20:51 Z tutis 가장 긴 여행 (IOI23_longesttrip) C++17
85 / 100
 54 ms 1376 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);
    }
    bool yes[256][256];
    bool no[256][256];
    for(int i=0;i<256;i++){
        for(int j=0;j<256;j++){
            yes[i][j]=false;
            no[i][j]=false;
        }
    }
    auto conn = [&](vector<int>x,vector<int>y) -> bool {
        int c1=0;
        for(int a: x){
            for(int b: y){
                if(yes[a][b]){
                    return true;
                }
                c1 += no[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[a][b]=true;
                    for(int c=0;c<N;c++){
                        if(no[a][c] && c!=a && c!=b){
                            yes[b][c] = true;
                            yes[c][b] = true;
                        }
                        if(no[b][c] && c!=a && c!=b){
                            yes[a][c] = true;
                            yes[c][a] = true;
                        }
                    }
                }
            }
        }
        if(ans && x.size()==1 && y.size()==1){
            yes[x[0]][y[0]]=true;
            yes[y[0]][x[0]]=true;
        }
        return ans;
    };
    auto fix=[&](){
        if(x.size()==0 || y.size()==0){
            return;
        }
        for(int a: x){
            for(int b: x){
                yes[a][b]=yes[b][a]=true;
            }
        }
        for(int a: y){
            for(int b: y){
                yes[a][b]=yes[b][a]=true;
            }
        }
    };
    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:31:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   31 |         if(c1==x.size()*y.size()){
      |            ~~^~~~~~~~~~~~~~~~~~~
longesttrip.cpp: In function 'std::vector<int> longest_trip(int, int)':
longesttrip.cpp:110:29: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  110 |             for(int i=lo+1;i<x.size();i++){
      |                            ~^~~~~~~~~

Subtask #0
0.0 / 0.0

# 결과 실행 시간 메모리 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

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 344 KB Output is correct
2 Correct 5 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 344 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 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 6 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 4 ms 344 KB Output is correct
12 Correct 4 ms 344 KB Output is correct
13 Correct 4 ms 344 KB Output is correct

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 344 KB Output is correct
2 Correct 6 ms 344 KB Output is correct
3 Correct 5 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 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 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 5 ms 344 KB Output is correct
13 Correct 5 ms 596 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 7 ms 344 KB Output is correct
18 Correct 6 ms 344 KB Output is correct
19 Correct 6 ms 600 KB Output is correct
20 Correct 5 ms 600 KB Output is correct
21 Correct 5 ms 600 KB Output is correct
22 Correct 5 ms 600 KB Output is correct
23 Correct 5 ms 576 KB Output is correct
24 Correct 6 ms 600 KB Output is correct
25 Correct 7 ms 344 KB Output is correct
26 Correct 8 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 9 ms 564 KB Output is correct
31 Correct 11 ms 564 KB Output is correct
32 Correct 11 ms 568 KB Output is correct
33 Correct 10 ms 576 KB Output is correct
34 Correct 14 ms 572 KB Output is correct
35 Correct 16 ms 568 KB Output is correct
36 Correct 38 ms 904 KB Output is correct
37 Correct 45 ms 1112 KB Output is correct
38 Correct 45 ms 1112 KB Output is correct
39 Correct 49 ms 848 KB Output is correct
40 Correct 52 ms 1112 KB Output is correct
41 Correct 49 ms 576 KB Output is correct
42 Correct 47 ms 1080 KB Output is correct
43 Correct 47 ms 824 KB Output is correct
44 Correct 51 ms 1084 KB Output is correct
45 Correct 7 ms 344 KB Output is correct
46 Correct 9 ms 344 KB Output is correct
47 Correct 9 ms 344 KB Output is correct
48 Correct 7 ms 344 KB Output is correct
49 Correct 7 ms 344 KB Output is correct
50 Correct 6 ms 564 KB Output is correct
51 Correct 8 ms 568 KB Output is correct
52 Correct 10 ms 568 KB Output is correct
53 Correct 7 ms 856 KB Output is correct
54 Correct 11 ms 600 KB Output is correct
55 Correct 8 ms 344 KB Output is correct
56 Correct 18 ms 1376 KB Output is correct
57 Correct 26 ms 852 KB Output is correct
58 Correct 21 ms 824 KB Output is correct
59 Correct 24 ms 1344 KB Output is correct
60 Correct 27 ms 604 KB Output is correct
61 Correct 21 ms 832 KB Output is correct
62 Correct 20 ms 824 KB Output is correct
63 Correct 18 ms 604 KB Output is correct
64 Correct 29 ms 608 KB Output is correct

Subtask #4
45.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 344 KB Output is correct
2 Correct 6 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 4 ms 344 KB Output is correct
6 Correct 8 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 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 5 ms 344 KB Output is correct
14 Correct 7 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 6 ms 344 KB Output is correct
18 Correct 7 ms 564 KB Output is correct
19 Correct 6 ms 600 KB Output is correct
20 Correct 6 ms 572 KB Output is correct
21 Correct 11 ms 540 KB Output is correct
22 Correct 8 ms 344 KB Output is correct
23 Correct 7 ms 344 KB Output is correct
24 Correct 8 ms 344 KB Output is correct
25 Correct 7 ms 344 KB Output is correct
26 Correct 8 ms 568 KB Output is correct
27 Correct 12 ms 564 KB Output is correct
28 Correct 12 ms 568 KB Output is correct
29 Correct 11 ms 572 KB Output is correct
30 Correct 17 ms 600 KB Output is correct
31 Correct 17 ms 576 KB Output is correct
32 Correct 7 ms 344 KB Output is correct
33 Correct 7 ms 344 KB Output is correct
34 Correct 9 ms 344 KB Output is correct
35 Correct 7 ms 344 KB Output is correct
36 Correct 7 ms 344 KB Output is correct
37 Correct 8 ms 568 KB Output is correct
38 Correct 9 ms 560 KB Output is correct
39 Correct 9 ms 564 KB Output is correct
40 Correct 6 ms 604 KB Output is correct
41 Correct 11 ms 600 KB Output is correct
42 Correct 8 ms 600 KB Output is correct
43 Correct 6 ms 828 KB Output is correct
44 Correct 6 ms 576 KB Output is correct
45 Correct 5 ms 576 KB Output is correct
46 Correct 5 ms 600 KB Output is correct
47 Partially correct 39 ms 856 KB Output is partially correct
48 Partially correct 44 ms 880 KB Output is partially correct
49 Partially correct 47 ms 1356 KB Output is partially correct
50 Partially correct 49 ms 596 KB Output is partially correct
51 Partially correct 48 ms 1088 KB Output is partially correct
52 Correct 51 ms 828 KB Output is correct
53 Correct 49 ms 1092 KB Output is correct
54 Correct 46 ms 836 KB Output is correct
55 Correct 52 ms 828 KB Output is correct
56 Partially correct 51 ms 1128 KB Output is partially correct
57 Partially correct 53 ms 864 KB Output is partially correct
58 Partially correct 45 ms 852 KB Output is partially correct
59 Partially correct 51 ms 844 KB Output is partially correct
60 Correct 49 ms 1084 KB Output is correct
61 Correct 54 ms 824 KB Output is correct
62 Partially correct 18 ms 1124 KB Output is partially correct
63 Partially correct 24 ms 604 KB Output is partially correct
64 Partially correct 20 ms 584 KB Output is partially correct
65 Partially correct 21 ms 608 KB Output is partially correct
66 Partially correct 25 ms 856 KB Output is partially correct
67 Correct 21 ms 1080 KB Output is correct
68 Correct 19 ms 820 KB Output is correct
69 Correct 17 ms 576 KB Output is correct
70 Correct 25 ms 856 KB Output is correct
71 Partially correct 27 ms 1112 KB Output is partially correct
72 Partially correct 19 ms 848 KB Output is partially correct
73 Partially correct 18 ms 840 KB Output is partially correct
74 Partially correct 30 ms 1084 KB Output is partially correct
75 Correct 33 ms 836 KB Output is correct
76 Correct 15 ms 568 KB Output is correct
77 Partially correct 19 ms 884 KB Output is partially correct
78 Partially correct 41 ms 860 KB Output is partially correct
79 Correct 14 ms 828 KB Output is correct
80 Partially correct 33 ms 824 KB Output is partially correct
81 Correct 29 ms 828 KB Output is correct
82 Correct 34 ms 1084 KB Output is correct