oj.uz

답안 #974754

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
974754 2024-05-03T18:17:43 Z Nika533 가장 긴 여행 (IOI23_longesttrip) C++17
5 / 100
 800 ms 668 KB 
#pragma GCC diagnostic warning "-std=c++11"
#include <bits/stdc++.h>
#include "longesttrip.h"
#define pb push_back
#define f first
#define s second
#define MOD 1000000007
#define flush fflush(stdout)
#define all(x) (x).begin(),(x).end()
#define allr(x) (x).rbegin(), (x).rend()
#define pii pair<int,int>
using namespace std;
int n,m,T,k;

vector<int> longest_trip(int N, int D) {
	vector<int> v;
	int e[N][N];
	for (int i=0; i<N; i++) {
		for (int j=0; j<N; j++) {
			e[i][j]=0;
		}
	}
	vector<int> v1,v2;
	for (int i=0; i<N; i++) {
		for (int j=i+1; j<N; j++) {
			vector<int> a,b; a.pb(i); b.pb(j);
			if (are_connected(a,b)) {
				e[i][j]=1; e[j][i]=1;
			}
		}
	}
	int cur=0; v.pb(cur);
	int l=0,r=-1;
	for (int i=1; i<N; i++) {
		if (e[cur][i]) {
			v.pb(i);
			if (i-cur>1) {
				l=cur+1;r=i-1;
			}
			cur=i;
			int check=-1;
			for (int j=l; j<=r; j++) {
				if (e[i][j]) check=j;
			}
			if (check!=-1) {
				v.pb(check);
				for (int j=l; j<=r; j++) {
					if (j!=check) v.pb(j);
				}
				cur=v.back();
				l=0; r=-1;
			}
		}
	}
	if (cur!=N-1) {
		l=cur+1; r=N-1;
	}
	if (r-l+1>N/2) {
		vector<int> v2;
		for (int i=l; i<=r; i++) v2.pb(i);
		return v2;
	}
	return v;
}

Compilation message

longesttrip.cpp:1:32: warning: '-std=c++11' is not an option that controls warnings [-Wpragmas]
    1 | #pragma GCC diagnostic warning "-std=c++11"
      |                                ^~~~~~~~~~~~

Subtask #0
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 170 ms 668 KB Incorrect
3 Halted 0 ms 0 KB -

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 344 KB Output is correct
2 Correct 24 ms 344 KB Output is correct
3 Correct 117 ms 344 KB Output is correct
4 Correct 349 ms 344 KB Output is correct
5 Correct 787 ms 668 KB Output is correct

Subtask #2
0.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 344 KB Output is correct
2 Correct 23 ms 344 KB Output is correct
3 Correct 127 ms 344 KB Output is correct
4 Correct 368 ms 344 KB Output is correct
5 Correct 770 ms 664 KB Output is correct
6 Incorrect 0 ms 344 KB Incorrect
7 Halted 0 ms 0 KB -

Subtask #3
0.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 344 KB Output is correct
2 Correct 29 ms 344 KB Output is correct
3 Correct 128 ms 500 KB Output is correct
4 Correct 382 ms 344 KB Output is correct
5 Correct 800 ms 664 KB Output is correct
6 Correct 6 ms 344 KB Output is correct
7 Incorrect 1 ms 344 KB Incorrect
8 Halted 0 ms 0 KB -

Subtask #4
0.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 344 KB Output is correct
2 Correct 20 ms 344 KB Output is correct
3 Partially correct 127 ms 584 KB Output is partially correct
4 Partially correct 368 ms 344 KB Output is partially correct
5 Partially correct 733 ms 668 KB Output is partially correct
6 Incorrect 0 ms 344 KB Incorrect
7 Halted 0 ms 0 KB -