oj.uz

Submission #977662

# Submission time Handle Problem Language Result Execution time Memory
977662 2024-05-08T08:48:20 Z SmuggingSpun Connecting Supertrees (IOI20_supertrees) C++14
11 / 100
 155 ms 20100 KB 
#include "supertrees.h"
#include<bits/stdc++.h>
using namespace std;
int construct(vector<vector<int>>p){
	int n = p.size();
	for(int i = 0; i < n; i++){
		for(int j = 0; j < n; j++){
			if(p[i][j] != 1){
				return 0;
			}
		}
		fill(p[i].begin(), p[i].end(), 0);
	}
	for(int i = 1; i < n; i++){
		p[i][i - 1] = p[i - 1][i] = 1;
	}
	build(p);
	return 1;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 10 ms 1056 KB Output is correct
7 Correct 155 ms 20100 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 10 ms 1056 KB Output is correct
7 Correct 155 ms 20100 KB Output is correct
8 Incorrect 0 ms 348 KB Answer gives possible 0 while actual possible 1
9 Halted 0 ms 0 KB -

Subtask #3
0 / 19.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB Answer gives possible 0 while actual possible 1
2 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Answer gives possible 0 while actual possible 1
2 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 10 ms 1056 KB Output is correct
7 Correct 155 ms 20100 KB Output is correct
8 Incorrect 0 ms 348 KB Answer gives possible 0 while actual possible 1
9 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 10 ms 1056 KB Output is correct
7 Correct 155 ms 20100 KB Output is correct
8 Incorrect 0 ms 348 KB Answer gives possible 0 while actual possible 1
9 Halted 0 ms 0 KB -