oj.uz

Submission #893177

# Submission time Handle Problem Language Result Execution time Memory
893177 2023-12-26T15:42:17 Z Trisanu_Das Thousands Islands (IOI22_islands) C++17
10 / 100
 25 ms 5328 KB 
#include<bits/stdc++.h>
#include "islands.h"
using namespace std;
 
variant<bool, vector<int> > find_journey(int N, int M, vector<int> U, vector<int> V){
	if(N == 2){
		vector<int> v0, v1;
		for(int i = 0; i < M; i++){
			if(U[i]==0) v0.push_back(i);
			else v1.push_back(i);
		}
		if(v0.size() < 2 || v1.size() < 1) return false;
		return vector<int>{v0[0], v1[0], v0[1], v0[0], v1[0], v0[1]};
	}
	if(N <= 400){
		int p[N + 5][N + 5];
		for(int i = 0; i < M; i++) p[U[i]][V[i]]=i;
		return vector<int>{p[0][1],p[1][0],p[0][2],p[2][0],p[1][0],p[0][1],p[2][0],p[0][2]};
	}
	return false;
}

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 21 ms 4740 KB Output is correct

Subtask #3
0.0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0.0 / 24.0

# Verdict Execution time Memory Grader output
1 Partially correct 0 ms 348 KB Output is partially correct
2 Partially correct 1 ms 348 KB Output is partially correct
3 Partially correct 21 ms 4140 KB Output is partially correct
4 Incorrect 23 ms 4388 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #5
0.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 25 ms 5328 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 21 ms 4740 KB Output is correct
14 Incorrect 1 ms 344 KB Output isn't correct
15 Halted 0 ms 0 KB -