oj.uz

Submission #974781

# Submission time Handle Problem Language Result Execution time Memory
974781 2024-05-03T19:11:34 Z Nika533 Longest Trip (IOI23_longesttrip) C++17
30 / 100
 807 ms 676 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();
			}
		}
	}
	for (int i=mx+1; i<N; i++) c.pb(i);
	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:57:14: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   57 |  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 180 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 26 ms 344 KB Output is correct
3 Correct 124 ms 344 KB Output is correct
4 Correct 386 ms 344 KB Output is correct
5 Correct 722 ms 668 KB Output is correct

Subtask #2
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 344 KB Output is correct
2 Correct 29 ms 344 KB Output is correct
3 Correct 125 ms 344 KB Output is correct
4 Correct 351 ms 344 KB Output is correct
5 Correct 759 ms 668 KB Output is correct
6 Incorrect 0 ms 344 KB Incorrect
7 Halted 0 ms 0 KB -

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 344 KB Output is correct
2 Correct 26 ms 344 KB Output is correct
3 Correct 124 ms 344 KB Output is correct
4 Correct 384 ms 344 KB Output is correct
5 Correct 774 ms 664 KB Output is correct
6 Correct 7 ms 344 KB Output is correct
7 Correct 22 ms 344 KB Output is correct
8 Correct 123 ms 340 KB Output is correct
9 Correct 285 ms 596 KB Output is correct
10 Correct 768 ms 668 KB Output is correct
11 Correct 779 ms 660 KB Output is correct
12 Correct 722 ms 664 KB Output is correct
13 Correct 717 ms 664 KB Output is correct
14 Correct 7 ms 344 KB Output is correct
15 Correct 12 ms 344 KB Output is correct
16 Correct 46 ms 344 KB Output is correct
17 Correct 79 ms 340 KB Output is correct
18 Correct 124 ms 344 KB Output is correct
19 Correct 275 ms 344 KB Output is correct
20 Correct 265 ms 344 KB Output is correct
21 Correct 741 ms 664 KB Output is correct
22 Correct 698 ms 668 KB Output is correct
23 Correct 741 ms 668 KB Output is correct
24 Correct 772 ms 664 KB Output is correct
25 Correct 10 ms 344 KB Output is correct
26 Correct 9 ms 344 KB Output is correct
27 Correct 19 ms 344 KB Output is correct
28 Correct 20 ms 344 KB Output is correct
29 Correct 22 ms 344 KB Output is correct
30 Correct 164 ms 344 KB Output is correct
31 Correct 175 ms 344 KB Output is correct
32 Correct 173 ms 344 KB Output is correct
33 Correct 244 ms 344 KB Output is correct
34 Correct 278 ms 344 KB Output is correct
35 Correct 261 ms 344 KB Output is correct
36 Correct 711 ms 668 KB Output is correct
37 Correct 740 ms 668 KB Output is correct
38 Correct 747 ms 668 KB Output is correct
39 Correct 763 ms 664 KB Output is correct
40 Correct 795 ms 668 KB Output is correct
41 Correct 768 ms 668 KB Output is correct
42 Correct 735 ms 668 KB Output is correct
43 Correct 738 ms 664 KB Output is correct
44 Correct 784 ms 668 KB Output is correct
45 Correct 11 ms 344 KB Output is correct
46 Correct 8 ms 344 KB Output is correct
47 Correct 24 ms 344 KB Output is correct
48 Correct 20 ms 344 KB Output is correct
49 Correct 23 ms 344 KB Output is correct
50 Correct 165 ms 344 KB Output is correct
51 Correct 151 ms 344 KB Output is correct
52 Correct 167 ms 344 KB Output is correct
53 Correct 276 ms 344 KB Output is correct
54 Correct 249 ms 344 KB Output is correct
55 Correct 263 ms 344 KB Output is correct
56 Correct 733 ms 668 KB Output is correct
57 Correct 692 ms 660 KB Output is correct
58 Correct 703 ms 664 KB Output is correct
59 Correct 705 ms 664 KB Output is correct
60 Correct 765 ms 664 KB Output is correct
61 Correct 748 ms 664 KB Output is correct
62 Correct 754 ms 668 KB Output is correct
63 Correct 807 ms 668 KB Output is correct
64 Correct 750 ms 676 KB Output is correct

Subtask #4
0.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 340 KB Output is correct
2 Correct 22 ms 344 KB Output is correct
3 Partially correct 129 ms 344 KB Output is partially correct
4 Partially correct 378 ms 344 KB Output is partially correct
5 Partially correct 764 ms 668 KB Output is partially correct
6 Incorrect 0 ms 344 KB Incorrect
7 Halted 0 ms 0 KB -