답안 #960186

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
960186	2024-04-09T20:20:16 Z	tutis	가장 긴 여행 (IOI23_longesttrip)	C++17	85 / 100	16 ms	972 KB

longesttrip

#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);
    for(int i:p){
        if(x.size()==0){
            x={i};
            continue;
        }
        if(y.size()==0){
            if(are_connected({i}, {x[0]})){
                x.insert(x.begin(),i);
                continue;
            }
            if (are_connected({i}, {x.back()})){
                x.push_back(i);
                continue;
            }
            if(!are_connected({i}, x)){
                y={i};
                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(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(rng()%2==0){
            swap(x,y);
        }
        if(!are_connected(x,{i})){
            y.push_back(i);
            continue;
        }
        if(!are_connected(y,{i})){
            x.push_back(i);
            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:47:29: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   47 |             for(int i=lo+1;i<x.size();i++){
      |                            ~^~~~~~~~~

Subtask #0

0.0 / 0.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	596 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	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	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	7 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	4 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	4 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

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	5 ms	344 KB	Output is correct
5	Correct	4 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	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	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	10 ms	344 KB	Output is correct
17	Correct	7 ms	344 KB	Output is correct
18	Correct	6 ms	600 KB	Output is correct
19	Correct	6 ms	856 KB	Output is correct
20	Correct	6 ms	440 KB	Output is correct
21	Correct	8 ms	448 KB	Output is correct
22	Correct	6 ms	700 KB	Output is correct
23	Correct	6 ms	704 KB	Output is correct
24	Correct	6 ms	604 KB	Output is correct
25	Correct	8 ms	344 KB	Output is correct
26	Correct	8 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	8 ms	344 KB	Output is correct
30	Correct	6 ms	444 KB	Output is correct
31	Correct	9 ms	600 KB	Output is correct
32	Correct	10 ms	344 KB	Output is correct
33	Correct	7 ms	440 KB	Output is correct
34	Correct	9 ms	444 KB	Output is correct
35	Correct	9 ms	600 KB	Output is correct
36	Correct	7 ms	468 KB	Output is correct
37	Correct	12 ms	468 KB	Output is correct
38	Correct	12 ms	716 KB	Output is correct
39	Correct	15 ms	612 KB	Output is correct
40	Correct	15 ms	704 KB	Output is correct
41	Correct	14 ms	448 KB	Output is correct
42	Correct	13 ms	448 KB	Output is correct
43	Correct	15 ms	448 KB	Output is correct
44	Correct	14 ms	452 KB	Output is correct
45	Correct	9 ms	344 KB	Output is correct
46	Correct	9 ms	344 KB	Output is correct
47	Correct	8 ms	344 KB	Output is correct
48	Correct	7 ms	344 KB	Output is correct
49	Correct	8 ms	344 KB	Output is correct
50	Correct	5 ms	640 KB	Output is correct
51	Correct	8 ms	440 KB	Output is correct
52	Correct	8 ms	344 KB	Output is correct
53	Correct	7 ms	444 KB	Output is correct
54	Correct	7 ms	440 KB	Output is correct
55	Correct	7 ms	444 KB	Output is correct
56	Correct	6 ms	876 KB	Output is correct
57	Correct	10 ms	712 KB	Output is correct
58	Correct	10 ms	708 KB	Output is correct
59	Correct	11 ms	956 KB	Output is correct
60	Correct	10 ms	860 KB	Output is correct
61	Correct	13 ms	444 KB	Output is correct
62	Correct	13 ms	448 KB	Output is correct
63	Correct	11 ms	444 KB	Output is correct
64	Correct	11 ms	436 KB	Output is correct

Subtask #4

45.0 / 60.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	416 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	6 ms	344 KB	Output is correct
8	Correct	5 ms	344 KB	Output is correct
9	Correct	5 ms	504 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	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	436 KB	Output is correct
19	Correct	6 ms	600 KB	Output is correct
20	Correct	6 ms	600 KB	Output is correct
21	Correct	9 ms	348 KB	Output is correct
22	Correct	7 ms	344 KB	Output is correct
23	Correct	7 ms	344 KB	Output is correct
24	Correct	6 ms	344 KB	Output is correct
25	Correct	7 ms	344 KB	Output is correct
26	Correct	7 ms	440 KB	Output is correct
27	Correct	8 ms	436 KB	Output is correct
28	Correct	9 ms	344 KB	Output is correct
29	Correct	7 ms	440 KB	Output is correct
30	Correct	8 ms	444 KB	Output is correct
31	Correct	8 ms	600 KB	Output is correct
32	Correct	10 ms	540 KB	Output is correct
33	Correct	10 ms	344 KB	Output is correct
34	Correct	7 ms	344 KB	Output is correct
35	Correct	9 ms	344 KB	Output is correct
36	Correct	9 ms	344 KB	Output is correct
37	Correct	6 ms	440 KB	Output is correct
38	Correct	8 ms	440 KB	Output is correct
39	Correct	8 ms	344 KB	Output is correct
40	Correct	6 ms	440 KB	Output is correct
41	Correct	7 ms	440 KB	Output is correct
42	Correct	8 ms	440 KB	Output is correct
43	Correct	6 ms	452 KB	Output is correct
44	Correct	7 ms	700 KB	Output is correct
45	Correct	7 ms	860 KB	Output is correct
46	Correct	5 ms	700 KB	Output is correct
47	Correct	7 ms	460 KB	Output is correct
48	Correct	12 ms	972 KB	Output is correct
49	Correct	13 ms	720 KB	Output is correct
50	Correct	14 ms	704 KB	Output is correct
51	Correct	16 ms	448 KB	Output is correct
52	Correct	13 ms	444 KB	Output is correct
53	Correct	14 ms	600 KB	Output is correct
54	Correct	13 ms	604 KB	Output is correct
55	Correct	14 ms	444 KB	Output is correct
56	Correct	12 ms	624 KB	Output is correct
57	Correct	13 ms	720 KB	Output is correct
58	Partially correct	13 ms	708 KB	Output is partially correct
59	Correct	14 ms	708 KB	Output is correct
60	Correct	14 ms	700 KB	Output is correct
61	Correct	16 ms	604 KB	Output is correct
62	Correct	6 ms	620 KB	Output is correct
63	Partially correct	10 ms	708 KB	Output is partially correct
64	Partially correct	11 ms	452 KB	Output is partially correct
65	Partially correct	13 ms	712 KB	Output is partially correct
66	Partially correct	10 ms	452 KB	Output is partially correct
67	Partially correct	11 ms	448 KB	Output is partially correct
68	Partially correct	14 ms	704 KB	Output is partially correct
69	Correct	13 ms	448 KB	Output is correct
70	Partially correct	10 ms	440 KB	Output is partially correct
71	Partially correct	10 ms	616 KB	Output is partially correct
72	Partially correct	12 ms	620 KB	Output is partially correct
73	Partially correct	9 ms	460 KB	Output is partially correct
74	Partially correct	10 ms	700 KB	Output is partially correct
75	Correct	11 ms	444 KB	Output is correct
76	Correct	10 ms	448 KB	Output is correct
77	Partially correct	10 ms	456 KB	Output is partially correct
78	Partially correct	9 ms	460 KB	Output is partially correct
79	Correct	8 ms	444 KB	Output is correct
80	Partially correct	11 ms	452 KB	Output is partially correct
81	Partially correct	13 ms	856 KB	Output is partially correct
82	Correct	11 ms	452 KB	Output is correct