oj.uz

답안 #980152

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
980152 2024-05-12T00:19:08 Z vjudge1 가장 긴 여행 (IOI23_longesttrip) C++17
0 / 100
 5 ms 748 KB 
#include "longesttrip.h"
#include <bits/stdc++.h>
#define rep(a,b,c) for(int a=b; a<c; a++)
#define repa(a,b) for(auto a:b)
#define ll long long
#define pll pair<ll, ll>
#define pb push_back
#define pf push_front
#define fi first
#define se second

using namespace std;

vector<int> longest_trip(int N, int D){
	if(D==1){
		deque<vector<int>> ans;
		rep(i,0,N){
			ans.pb({i});
		}
		while(ans.size()>1){
			if(are_connected({ans[0].back()},{ans[1].back()})){
				reverse(ans[1].begin(),ans[1].end());
				repa(e,ans[1]) ans[0].pb(e);
				ans.erase(ans.begin()+1);
			}else if(are_connected({ans[0].back()},{ans[2].back()})){
				reverse(ans[2].begin(),ans[2].end());
				repa(e,ans[2]) ans[0].pb(e);
				ans.erase(ans.begin()+2);
			}else{
				reverse(ans[2].begin(),ans[2].end());
				repa(e,ans[2]) ans[1].pb(e);
				ans.erase(ans.begin()+2);
			}
		}
		if(ans[0].size()>ans[1].size()) return ans[0];
		else return ans[1];
	}else{
		deque<int> ans;
		vector<int> aaa;
		ans.pb(0);
		int lf;
		if(are_connected({1},{0})) ans.pb(1), lf=2;
		else ans.pb(2), lf=1;
		if(are_connected({1},{2})) ans.pb(lf);
		else ans.pf(lf);
		rep(i,3,N){
			if(are_connected({i},{ans.back()})) ans.pb(i);
			else ans.pf(i);
		}
		repa(e,ans) aaa.pb(e);
	}
}

Compilation message

longesttrip.cpp: In function 'std::vector<int> longest_trip(int, int)':
longesttrip.cpp:52:1: warning: control reaches end of non-void function [-Wreturn-type]
   52 | }
      | ^

Subtask #0
0.0 / 0.0

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

Subtask #1
0.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 2 ms 600 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 2 ms 600 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 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 4 ms 448 KB Output is correct
6 Runtime error 0 ms 344 KB Execution killed with signal 11
7 Halted 0 ms 0 KB -

Subtask #4
0.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 344 KB Output is correct
2 Correct 5 ms 344 KB Output is correct
3 Correct 5 ms 748 KB Output is correct
4 Correct 4 ms 344 KB Output is correct
5 Correct 4 ms 452 KB Output is correct
6 Runtime error 1 ms 344 KB Execution killed with signal 11
7 Halted 0 ms 0 KB -