oj.uz

답안 #840776

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
840776 2023-08-31T16:55:49 Z de_sousa 가장 긴 여행 (IOI23_longesttrip) C++17
85 / 100
 32 ms 356 KB 
#include "longesttrip.h"
#include <bits/stdc++.h>
using namespace std;

std::vector<int> longest_trip(int N, int D)
{
    vector<int> S1;
    vector<int> S2;
    S1.push_back(0);
    S2.push_back(1);
    for(int i=2;i<N;i++){
	if(!are_connected({S1.back(),S2.back()},{i})){
	    while(S2.size()){
		S1.push_back(S2.back());
		S2.pop_back();
	    }
	    S2.push_back(i);
	}
	else if(are_connected({S2.back()},{i})){
	    S2.push_back(i);
	}
	else{
	    S1.push_back(i);
	}
    }
    
    if(S1.size()<S2.size())swap(S1,S2);
    
    if(!are_connected(S1,S2))
	return S1;

    if(!are_connected({S1[0]},{S1.back()})){
	if(!are_connected({S1.back()},{S2.back()}))reverse(S1.begin(),S1.end());
	while(S2.size()){
	    S1.push_back(S2.back());
	    S2.pop_back();
	}
	return S1;
    }

    if(S2.size()!=1&&!are_connected({S2[0]},{S2.back()})){
	if(!are_connected({S2.back()},{S1.back()}))reverse(S2.begin(),S2.end());
	while(S1.size()){
	    S2.push_back(S1.back());
	    S1.pop_back();
	}
	return S2;
    }


    vector<int> cand1=S1;
    vector<int> cand2=S2;

    while(cand1.size()!=1){
	vector<int> tmp1=cand1;
	vector<int> tmp2;
	int target=tmp1.size()/2;
	while(tmp1.size()!=target){
	    tmp2.push_back(tmp1.back());
	    tmp1.pop_back();
	}
	if(are_connected(tmp1,cand2))cand1=tmp1;
	else cand1=tmp2;	
    }
    swap(cand1,cand2);
    
    while(cand1.size()!=1){
	vector<int> tmp1=cand1;
	vector<int> tmp2;
	int target=tmp1.size()/2;
	while(tmp1.size()!=target){
	    tmp2.push_back(tmp1.back());
	    tmp1.pop_back();
	}
	if(are_connected(tmp1,cand2))cand1=tmp1;
	else cand1=tmp2;	
    }
    swap(cand1,cand2);

    int pos1=0;
    for(int i=0;i<S1.size();i++){
	if(S1[i]==cand1[0])pos1=i;
    }

    int pos2=0;
    for(int i=0;i<S2.size();i++){
	if(S2[i]==cand2[0])pos2=i;
    }

    vector<int> S3;
    S3.push_back(S1[pos1]);
    for(int i=(pos1+1)%S1.size();i!=pos1;i=(i+1)%S1.size())S3.push_back(S1[i]);
    reverse(S3.begin(),S3.end());
    S3.push_back(S2[pos2]);
    for(int i=(pos2+1)%S2.size();i!=pos2;i=(i+1)%S2.size())S3.push_back(S2[i]);
    return S3;
    
    
}

Compilation message

longesttrip.cpp: In function 'std::vector<int> longest_trip(int, int)':
longesttrip.cpp:58:19: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   58 |  while(tmp1.size()!=target){
      |        ~~~~~~~~~~~^~~~~~~~
longesttrip.cpp:71:19: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   71 |  while(tmp1.size()!=target){
      |        ~~~~~~~~~~~^~~~~~~~
longesttrip.cpp:81:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   81 |     for(int i=0;i<S1.size();i++){
      |                 ~^~~~~~~~~~
longesttrip.cpp:86:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   86 |     for(int i=0;i<S2.size();i++){
      |                 ~^~~~~~~~~~

Subtask #0
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 6 ms 208 KB Output is correct

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 208 KB Output is correct
2 Correct 20 ms 236 KB Output is correct
3 Correct 20 ms 256 KB Output is correct
4 Correct 17 ms 336 KB Output is correct
5 Correct 18 ms 208 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 208 KB Output is correct
2 Correct 17 ms 208 KB Output is correct
3 Correct 19 ms 208 KB Output is correct
4 Correct 20 ms 208 KB Output is correct
5 Correct 14 ms 208 KB Output is correct
6 Correct 18 ms 208 KB Output is correct
7 Correct 21 ms 208 KB Output is correct
8 Correct 20 ms 208 KB Output is correct
9 Correct 11 ms 300 KB Output is correct
10 Correct 17 ms 336 KB Output is correct
11 Correct 22 ms 208 KB Output is correct
12 Correct 20 ms 320 KB Output is correct
13 Correct 16 ms 300 KB Output is correct

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 208 KB Output is correct
2 Correct 26 ms 208 KB Output is correct
3 Correct 14 ms 208 KB Output is correct
4 Correct 25 ms 300 KB Output is correct
5 Correct 9 ms 208 KB Output is correct
6 Correct 20 ms 256 KB Output is correct
7 Correct 21 ms 208 KB Output is correct
8 Correct 20 ms 208 KB Output is correct
9 Correct 16 ms 208 KB Output is correct
10 Correct 23 ms 208 KB Output is correct
11 Correct 14 ms 300 KB Output is correct
12 Correct 13 ms 208 KB Output is correct
13 Correct 14 ms 300 KB Output is correct
14 Correct 8 ms 208 KB Output is correct
15 Correct 8 ms 208 KB Output is correct
16 Correct 16 ms 208 KB Output is correct
17 Correct 12 ms 208 KB Output is correct
18 Correct 12 ms 208 KB Output is correct
19 Correct 15 ms 208 KB Output is correct
20 Correct 15 ms 256 KB Output is correct
21 Correct 21 ms 296 KB Output is correct
22 Correct 15 ms 304 KB Output is correct
23 Correct 17 ms 300 KB Output is correct
24 Correct 16 ms 356 KB Output is correct
25 Correct 13 ms 256 KB Output is correct
26 Correct 32 ms 256 KB Output is correct
27 Correct 21 ms 208 KB Output is correct
28 Correct 16 ms 208 KB Output is correct
29 Correct 17 ms 208 KB Output is correct
30 Correct 11 ms 208 KB Output is correct
31 Correct 17 ms 208 KB Output is correct
32 Correct 11 ms 208 KB Output is correct
33 Correct 18 ms 352 KB Output is correct
34 Correct 18 ms 208 KB Output is correct
35 Correct 18 ms 300 KB Output is correct
36 Correct 15 ms 236 KB Output is correct
37 Correct 19 ms 256 KB Output is correct
38 Correct 14 ms 352 KB Output is correct
39 Correct 14 ms 356 KB Output is correct
40 Correct 16 ms 208 KB Output is correct
41 Correct 18 ms 208 KB Output is correct
42 Correct 22 ms 208 KB Output is correct
43 Correct 17 ms 208 KB Output is correct
44 Correct 16 ms 300 KB Output is correct
45 Correct 14 ms 256 KB Output is correct
46 Correct 11 ms 208 KB Output is correct
47 Correct 24 ms 208 KB Output is correct
48 Correct 13 ms 208 KB Output is correct
49 Correct 24 ms 208 KB Output is correct
50 Correct 15 ms 256 KB Output is correct
51 Correct 16 ms 208 KB Output is correct
52 Correct 12 ms 208 KB Output is correct
53 Correct 13 ms 256 KB Output is correct
54 Correct 9 ms 208 KB Output is correct
55 Correct 17 ms 252 KB Output is correct
56 Correct 14 ms 304 KB Output is correct
57 Correct 20 ms 256 KB Output is correct
58 Correct 22 ms 288 KB Output is correct
59 Correct 14 ms 324 KB Output is correct
60 Correct 17 ms 328 KB Output is correct
61 Correct 13 ms 256 KB Output is correct
62 Correct 14 ms 256 KB Output is correct
63 Correct 20 ms 348 KB Output is correct
64 Correct 26 ms 256 KB Output is correct

Subtask #4
45.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 208 KB Output is correct
2 Correct 14 ms 208 KB Output is correct
3 Correct 19 ms 208 KB Output is correct
4 Correct 14 ms 208 KB Output is correct
5 Partially correct 15 ms 208 KB Output is partially correct
6 Correct 18 ms 208 KB Output is correct
7 Correct 19 ms 252 KB Output is correct
8 Correct 13 ms 208 KB Output is correct
9 Correct 15 ms 208 KB Output is correct
10 Partially correct 17 ms 300 KB Output is partially correct
11 Partially correct 19 ms 208 KB Output is partially correct
12 Partially correct 12 ms 300 KB Output is partially correct
13 Partially correct 18 ms 208 KB Output is partially correct
14 Correct 8 ms 208 KB Output is correct
15 Correct 14 ms 208 KB Output is correct
16 Correct 21 ms 256 KB Output is correct
17 Correct 24 ms 208 KB Output is correct
18 Correct 20 ms 296 KB Output is correct
19 Correct 21 ms 208 KB Output is correct
20 Correct 19 ms 208 KB Output is correct
21 Correct 11 ms 208 KB Output is correct
22 Correct 8 ms 208 KB Output is correct
23 Correct 16 ms 208 KB Output is correct
24 Correct 8 ms 208 KB Output is correct
25 Correct 11 ms 208 KB Output is correct
26 Correct 12 ms 208 KB Output is correct
27 Correct 18 ms 208 KB Output is correct
28 Correct 21 ms 208 KB Output is correct
29 Correct 22 ms 324 KB Output is correct
30 Correct 18 ms 296 KB Output is correct
31 Correct 8 ms 208 KB Output is correct
32 Correct 17 ms 208 KB Output is correct
33 Correct 23 ms 256 KB Output is correct
34 Correct 18 ms 208 KB Output is correct
35 Correct 19 ms 208 KB Output is correct
36 Correct 18 ms 208 KB Output is correct
37 Correct 18 ms 300 KB Output is correct
38 Correct 19 ms 208 KB Output is correct
39 Correct 14 ms 208 KB Output is correct
40 Correct 9 ms 208 KB Output is correct
41 Correct 14 ms 296 KB Output is correct
42 Correct 17 ms 208 KB Output is correct
43 Partially correct 19 ms 288 KB Output is partially correct
44 Partially correct 22 ms 284 KB Output is partially correct
45 Partially correct 14 ms 300 KB Output is partially correct
46 Partially correct 19 ms 304 KB Output is partially correct
47 Partially correct 13 ms 208 KB Output is partially correct
48 Partially correct 18 ms 208 KB Output is partially correct
49 Partially correct 13 ms 208 KB Output is partially correct
50 Partially correct 19 ms 336 KB Output is partially correct
51 Partially correct 24 ms 256 KB Output is partially correct
52 Partially correct 16 ms 208 KB Output is partially correct
53 Partially correct 14 ms 208 KB Output is partially correct
54 Partially correct 9 ms 336 KB Output is partially correct
55 Partially correct 18 ms 208 KB Output is partially correct
56 Partially correct 14 ms 300 KB Output is partially correct
57 Partially correct 17 ms 208 KB Output is partially correct
58 Partially correct 12 ms 256 KB Output is partially correct
59 Partially correct 15 ms 208 KB Output is partially correct
60 Partially correct 14 ms 336 KB Output is partially correct
61 Partially correct 14 ms 208 KB Output is partially correct
62 Partially correct 15 ms 328 KB Output is partially correct
63 Partially correct 19 ms 304 KB Output is partially correct
64 Partially correct 14 ms 244 KB Output is partially correct
65 Partially correct 22 ms 208 KB Output is partially correct
66 Partially correct 12 ms 208 KB Output is partially correct
67 Partially correct 19 ms 208 KB Output is partially correct
68 Partially correct 19 ms 208 KB Output is partially correct
69 Partially correct 19 ms 208 KB Output is partially correct
70 Partially correct 14 ms 208 KB Output is partially correct
71 Partially correct 18 ms 208 KB Output is partially correct
72 Partially correct 16 ms 300 KB Output is partially correct
73 Partially correct 23 ms 304 KB Output is partially correct
74 Partially correct 15 ms 208 KB Output is partially correct
75 Partially correct 14 ms 296 KB Output is partially correct
76 Partially correct 12 ms 208 KB Output is partially correct
77 Partially correct 19 ms 288 KB Output is partially correct
78 Partially correct 16 ms 300 KB Output is partially correct
79 Partially correct 18 ms 356 KB Output is partially correct
80 Partially correct 23 ms 300 KB Output is partially correct
81 Partially correct 18 ms 300 KB Output is partially correct
82 Partially correct 18 ms 344 KB Output is partially correct