oj.uz

답안 #960188

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
960188 2024-04-09T20:36:19 Z tutis 가장 긴 여행 (IOI23_longesttrip) C++17
85 / 100
 19 ms 972 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);
    }
    shuffle(p.begin(),p.end(),rng);
    int color[N];
    for(int i=0;i<N;i++){
        color[i]=0;
    }
    for(int i:p){
        if(x.size()==0){
            x={i};
            color[i]=1;
            continue;
        }
        if(y.size()==0){
            if(are_connected({i}, {x[0]})){
                x.insert(x.begin(),i);
                continue;
            }
            if(color[x[0]]!=color[x.back()] && color[x[0]]!=0 && color[x.back()]!=0){
                x.push_back(i);
                continue;
            } else{
                if (are_connected({i}, {x.back()})){
                    x.push_back(i);
                    continue;
                }
            }
            if(!are_connected({i}, x)){
                y={i};
                for(int i: x){
                    color[i]=1;
                }
                for(int i: y){
                    color[i]=2;
                }
                continue;
            }
            int lo=1;
            int hi=x.size()-2;
            int c=color[x[0]];
            if(c==0){
                c=color[x.back()];
            }
            if(c!=0){
                color[i]=3-c;
            }
            for(int i=lo;i<=hi;i++){
                if(color[x[i]]!=c && color[x[i]]!=0 && c!=0){
                    lo=hi=i;
                }
            }
            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;
                }
            }
            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(!are_connected(x,{i})){
            y.push_back(i);
            color[i]=color[y[0]];
            continue;
        }
        if(!are_connected(y,{i})){
            x.push_back(i);
            color[i]=color[x[0]];
            continue;
        }
        int i0=0;
        int j0=0;
        if(!are_connected({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 function 'std::vector<int> longest_trip(int, int)':
longesttrip.cpp:75:29: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   75 |             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 600 KB Output is correct

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 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 4 ms 344 KB Output is correct
5 Correct 4 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 4 ms 344 KB Output is correct
5 Correct 5 ms 344 KB Output is correct
6 Correct 10 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 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 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 4 ms 344 KB Output is correct
6 Correct 8 ms 344 KB Output is correct
7 Correct 7 ms 344 KB Output is correct
8 Correct 4 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 4 ms 344 KB Output is correct
13 Correct 4 ms 344 KB Output is correct
14 Correct 9 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 444 KB Output is correct
19 Correct 7 ms 600 KB Output is correct
20 Correct 6 ms 600 KB Output is correct
21 Correct 6 ms 700 KB Output is correct
22 Correct 8 ms 452 KB Output is correct
23 Correct 8 ms 608 KB Output is correct
24 Correct 7 ms 700 KB Output is correct
25 Correct 9 ms 344 KB Output is correct
26 Correct 7 ms 344 KB Output is correct
27 Correct 8 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 8 ms 440 KB Output is correct
31 Correct 9 ms 440 KB Output is correct
32 Correct 8 ms 344 KB Output is correct
33 Correct 10 ms 600 KB Output is correct
34 Correct 11 ms 856 KB Output is correct
35 Correct 11 ms 444 KB Output is correct
36 Correct 13 ms 456 KB Output is correct
37 Correct 19 ms 468 KB Output is correct
38 Correct 16 ms 456 KB Output is correct
39 Correct 14 ms 708 KB Output is correct
40 Correct 15 ms 452 KB Output is correct
41 Correct 14 ms 696 KB Output is correct
42 Correct 13 ms 444 KB Output is correct
43 Correct 15 ms 448 KB Output is correct
44 Correct 14 ms 448 KB Output is correct
45 Correct 8 ms 344 KB Output is correct
46 Correct 9 ms 344 KB Output is correct
47 Correct 7 ms 344 KB Output is correct
48 Correct 7 ms 344 KB Output is correct
49 Correct 6 ms 344 KB Output is correct
50 Correct 6 ms 436 KB Output is correct
51 Correct 9 ms 440 KB Output is correct
52 Correct 7 ms 344 KB Output is correct
53 Correct 6 ms 440 KB Output is correct
54 Correct 6 ms 344 KB Output is correct
55 Correct 10 ms 600 KB Output is correct
56 Correct 8 ms 968 KB Output is correct
57 Correct 13 ms 960 KB Output is correct
58 Correct 15 ms 460 KB Output is correct
59 Correct 10 ms 456 KB Output is correct
60 Correct 10 ms 856 KB Output is correct
61 Correct 10 ms 444 KB Output is correct
62 Correct 12 ms 596 KB Output is correct
63 Correct 12 ms 448 KB Output is correct
64 Correct 11 ms 452 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 6 ms 344 KB Output is correct
4 Correct 4 ms 344 KB Output is correct
5 Correct 4 ms 344 KB Output is correct
6 Correct 13 ms 344 KB Output is correct
7 Correct 6 ms 596 KB Output is correct
8 Correct 4 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
14 Correct 9 ms 344 KB Output is correct
15 Correct 9 ms 344 KB Output is correct
16 Correct 7 ms 344 KB Output is correct
17 Correct 7 ms 344 KB Output is correct
18 Correct 7 ms 600 KB Output is correct
19 Correct 7 ms 600 KB Output is correct
20 Correct 6 ms 448 KB Output is correct
21 Correct 12 ms 344 KB Output is correct
22 Correct 9 ms 344 KB Output is correct
23 Correct 7 ms 344 KB Output is correct
24 Correct 7 ms 344 KB Output is correct
25 Correct 7 ms 344 KB Output is correct
26 Correct 8 ms 444 KB Output is correct
27 Correct 9 ms 444 KB Output is correct
28 Correct 8 ms 344 KB Output is correct
29 Correct 10 ms 440 KB Output is correct
30 Correct 10 ms 444 KB Output is correct
31 Correct 11 ms 444 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 6 ms 344 KB Output is correct
37 Correct 6 ms 432 KB Output is correct
38 Correct 8 ms 444 KB Output is correct
39 Correct 7 ms 344 KB Output is correct
40 Correct 6 ms 444 KB Output is correct
41 Correct 7 ms 344 KB Output is correct
42 Correct 9 ms 600 KB Output is correct
43 Correct 6 ms 956 KB Output is correct
44 Correct 6 ms 704 KB Output is correct
45 Correct 5 ms 704 KB Output is correct
46 Correct 6 ms 600 KB Output is correct
47 Partially correct 13 ms 464 KB Output is partially correct
48 Partially correct 18 ms 464 KB Output is partially correct
49 Partially correct 15 ms 716 KB Output is partially correct
50 Partially correct 15 ms 452 KB Output is partially correct
51 Partially correct 14 ms 608 KB Output is partially correct
52 Correct 15 ms 444 KB Output is correct
53 Correct 13 ms 444 KB Output is correct
54 Correct 13 ms 444 KB Output is correct
55 Correct 14 ms 448 KB Output is correct
56 Partially correct 18 ms 472 KB Output is partially correct
57 Partially correct 16 ms 464 KB Output is partially correct
58 Partially correct 16 ms 704 KB Output is partially correct
59 Partially correct 14 ms 704 KB Output is partially correct
60 Correct 17 ms 448 KB Output is correct
61 Correct 13 ms 444 KB Output is correct
62 Partially correct 9 ms 720 KB Output is partially correct
63 Partially correct 12 ms 972 KB Output is partially correct
64 Partially correct 14 ms 712 KB Output is partially correct
65 Partially correct 10 ms 708 KB Output is partially correct
66 Correct 9 ms 708 KB Output is correct
67 Correct 11 ms 440 KB Output is correct
68 Correct 10 ms 444 KB Output is correct
69 Correct 12 ms 600 KB Output is correct
70 Partially correct 13 ms 448 KB Output is partially correct
71 Partially correct 11 ms 704 KB Output is partially correct
72 Partially correct 13 ms 612 KB Output is partially correct
73 Partially correct 10 ms 452 KB Output is partially correct
74 Partially correct 11 ms 452 KB Output is partially correct
75 Correct 7 ms 444 KB Output is correct
76 Partially correct 11 ms 440 KB Output is partially correct
77 Partially correct 10 ms 460 KB Output is partially correct
78 Partially correct 10 ms 704 KB Output is partially correct
79 Partially correct 14 ms 712 KB Output is partially correct
80 Correct 9 ms 704 KB Output is correct
81 Correct 10 ms 596 KB Output is correct
82 Partially correct 9 ms 452 KB Output is partially correct