oj.uz

답안 #840675

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
840675 2023-08-31T15:30:42 Z de_sousa 가장 긴 여행 (IOI23_longesttrip) C++17
25 / 100
 14 ms 336 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()},{i})){
	    S1.push_back(i);
	}
	else if(are_connected({S2.back()},{i})){
	    S2.push_back(i);
	}
	else{
	    while(S2.size()){
		S1.push_back(S2.back());
		S2.pop_back();
	    }
	    S2.push_back(i);
	}
    }
    
    if(S1.size()<S2.size())swap(S1,S2);
    return S1;
    
    
    if(!are_connected(S1,S2))
	return S1;

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

    if(S2.size()!=1&&!are_connected({S2[0]},{S2.back()})){
	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 Incorrect 1 ms 244 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #1
0.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 208 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 208 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #3
25.0 / 25.0

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

Subtask #4
0.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 208 KB Incorrect
2 Halted 0 ms 0 KB -