oj.uz

Submission #980137

# Submission time Handle Problem Language Result Execution time Memory
980137 2024-05-12T00:09:01 Z vjudge1 Longest Trip (IOI23_longesttrip) C++17
5 / 100
 8 ms 600 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){
	deque<vector<int>> ans;
	rep(i,0,N){
		ans.pb({i});
	}
	while(ans.size()>1){
		if(are_connected({ans[0].back()},{ans[1].back()})){
			repa(e,ans[1]) ans[0].pb(e);
			ans.erase(ans.begin()+1);
		}else{
			repa(e,ans[2]) ans[0].pb(e);
			ans.erase(ans.begin()+2);
		}
	}
	if(ans[0].size()>ans[1].size()) return ans[0];
	else return ans[1];
}

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 344 KB Output is correct
2 Correct 5 ms 344 KB Output is correct
3 Correct 6 ms 344 KB Output is correct
4 Correct 6 ms 344 KB Output is correct
5 Correct 5 ms 600 KB Output is correct

Subtask #2
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 356 KB Output is correct
2 Correct 5 ms 344 KB Output is correct
3 Correct 5 ms 596 KB Output is correct
4 Correct 6 ms 344 KB Output is correct
5 Correct 5 ms 600 KB Output is correct
6 Incorrect 0 ms 344 KB Incorrect
7 Halted 0 ms 0 KB -

Subtask #3
0.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 8 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 6 ms 344 KB Output is correct
5 Correct 5 ms 452 KB Output is correct
6 Correct 6 ms 344 KB Output is correct
7 Correct 5 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 4 ms 452 KB Output is correct
11 Correct 6 ms 600 KB Output is correct
12 Correct 4 ms 600 KB Output is correct
13 Correct 4 ms 456 KB Output is correct
14 Incorrect 0 ms 344 KB Incorrect
15 Halted 0 ms 0 KB -

Subtask #4
0.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 344 KB Output is correct
2 Correct 6 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 5 ms 448 KB Output is correct
6 Incorrect 0 ms 344 KB Incorrect
7 Halted 0 ms 0 KB -