oj.uz

Submission #902863

# Submission time Handle Problem Language Result Execution time Memory
902863 2024-01-11T03:39:26 Z ByeWorld Connecting Supertrees (IOI20_supertrees) C++14
0 / 100
 1 ms 600 KB 
#include "supertrees.h"
#include <bits/stdc++.h>
#define ll long long
#define fi first
#define se second
#define pb push_back
#define lb lower_bound
using namespace std;
const int MAXN = 1e3+10;
const double SMALL = 1e-6;
typedef pair<int,int> pii;
typedef pair<pii,int> ipii;

int n;
bool tag[MAXN], done[MAXN];
vector <vector<int>> adj;

void bd(int x, int y){
	adj[x][y] = 1; adj[y][x] = 1;
}

int construct(vector<vector<int>> p) {
	n = p.size();
	vector <int> te(n);
	for(int i=0; i<n; i++) adj.pb(te);

	for(int i = 0; i < n; i++) {
		if(done[i]) continue;
		
		for(int j=i+1; j < n; j++){
			for(int x=0; x<n; x++) tag[x] = 0;

			vector <int> vec; vec.pb(i); 
			tag[i] = 1;
			if(p[i][j] == 1){
				vec.pb(j); tag[j] = 1;
			}
			
			for(auto in : vec){
				for(int x=0; x<n; x++){
					if(tag[x] && p[in][x] != 1) return 0; //harusnya 1
					if(!tag[x] && p[in][x] == 1) return 0;
				}
			}
			for(auto x : vec){ // build
				done[x] = 1;
				for(auto y : vec){
					if(x==y) continue;
					bd(x, y);
				}
			}
		}
	}

	for(int i=0; i<n; i++) adj[i][i] = 0;
	build(adj);
	return 1;
}

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Incorrect 0 ms 600 KB Answer gives possible 0 while actual possible 1
4 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Incorrect 0 ms 600 KB Answer gives possible 0 while actual possible 1
4 Halted 0 ms 0 KB -

Subtask #3
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Incorrect 1 ms 348 KB Answer gives possible 1 while actual possible 0
5 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB Too few ways to get from 0 to 1, should be 2 found 0
3 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Incorrect 0 ms 600 KB Answer gives possible 0 while actual possible 1
4 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Incorrect 0 ms 600 KB Answer gives possible 0 while actual possible 1
4 Halted 0 ms 0 KB -