oj.uz

Submission #974778

# Submission time Handle Problem Language Result Execution time Memory
974778 2024-05-03T19:02:27 Z Nika533 Longest Trip (IOI23_longesttrip) C++17
5 / 100
 769 ms 848 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,mx=0; v.pb(cur);
	vector<int> c;
	for (int i=1; i<N; i++) {
		if (e[cur][i]) {
			v.pb(i);
			if (i-cur>1) {
				int l=mx+1,r=i-1;
				for (int j=l; j<=r; j++) c.pb(j);
			}
			cur=i; mx=i;
			int check=-1;
			for (auto j:c) {
				if (e[i][j]) check=j;
			}
			if (check!=-1) {
				v.pb(check);
				for (auto j:c) {
					if (j!=check) v.pb(j);
				}
				cur=v.back();
				c.clear();
			}
		}
	}
	if (c.size()>N/2) return c;
	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"
      |                                ^~~~~~~~~~~~
longesttrip.cpp: In function 'std::vector<int> longest_trip(int, int)':
longesttrip.cpp:56:14: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   56 |  if (c.size()>N/2) return c;
      |      ~~~~~~~~^~~~

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 188 ms 668 KB Output is correct

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 344 KB Output is correct
2 Correct 23 ms 344 KB Output is correct
3 Correct 129 ms 344 KB Output is correct
4 Correct 376 ms 344 KB Output is correct
5 Correct 728 ms 664 KB Output is correct

Subtask #2
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 344 KB Output is correct
2 Correct 21 ms 344 KB Output is correct
3 Correct 116 ms 344 KB Output is correct
4 Correct 392 ms 344 KB Output is correct
5 Correct 750 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

# Verdict Execution time Memory Grader output
1 Correct 7 ms 344 KB Output is correct
2 Correct 21 ms 344 KB Output is correct
3 Correct 111 ms 596 KB Output is correct
4 Correct 355 ms 344 KB Output is correct
5 Correct 761 ms 848 KB Output is correct
6 Correct 7 ms 344 KB Output is correct
7 Correct 22 ms 344 KB Output is correct
8 Correct 127 ms 344 KB Output is correct
9 Correct 268 ms 344 KB Output is correct
10 Correct 769 ms 664 KB Output is correct
11 Correct 758 ms 664 KB Output is correct
12 Correct 742 ms 664 KB Output is correct
13 Correct 726 ms 660 KB Output is correct
14 Correct 8 ms 344 KB Output is correct
15 Incorrect 2 ms 344 KB Incorrect
16 Halted 0 ms 0 KB -

Subtask #4
0.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 344 KB Output is correct
2 Correct 24 ms 344 KB Output is correct
3 Partially correct 135 ms 344 KB Output is partially correct
4 Partially correct 335 ms 344 KB Output is partially correct
5 Partially correct 706 ms 848 KB Output is partially correct
6 Incorrect 0 ms 344 KB Incorrect
7 Halted 0 ms 0 KB -