oj.uz

답안 #300659

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
300659 2020-09-17T11:11:48 Z Kerim 슈퍼트리 잇기 (IOI20_supertrees) C++17
11 / 100
 258 ms 22264 KB 
#include "supertrees.h"
#include "bits/stdc++.h"
#define MAXN 100009
#define INF 1000000007
#define mp(x,y) make_pair(x,y)
#define all(v) v.begin(),v.end()
#define pb(x) push_back(x)
#define wr cout<<"----------------"<<endl;
#define ppb() pop_back()
#define tr(ii,c) for(__typeof((c).begin()) ii=(c).begin();ii!=(c).end();ii++)
#define ff first
#define ss second
#define my_little_dodge 46
#define debug(x)  cerr<< #x <<" = "<< x<<endl;
using namespace std;

typedef long long ll;
typedef pair<int,int> PII;
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
int vis[MAXN];
int construct(std::vector<std::vector<int>> p) {
	int n = p.size();
	std::vector<std::vector<int>> answer;
	for (int i = 0; i < n; i++) {
		std::vector<int> row;
		row.resize(n);
		answer.push_back(row);
	}int mx=0;
	for(int i=0;i<n;i++)
		for(int j=0;j<n;j++)
			umax(mx,p[i][j]);
	if(mx==0){
		build(answer);
		return 1;	
	}
	if(mx==1){
		int cnt=0;
		for(int i=0;i<n;i++)
			if(!vis[i]){vis[i]=++cnt;
				for(int j=i+1;j<n;j++)
					if(!vis[j] and p[i][j])
						answer[i][j]=answer[j][i]=1,vis[j]=cnt;
			}
		for(int i=0;i<n;i++)
			for(int j=0;j<n;j++)
				if(p[i][j] and vis[i]!=vis[j])
					return 0;
		build(answer);
		return 1;
	}
	if(mx==2){
		vector<int>cur;int cnt=0;
		for(int i=0;i<n;i++)
			if(!vis[i]){
				cur.clear();
				vis[i]=++cnt;cur.pb(i);
				for(int j=i+1;j<n;j++)
					if(!vis[j] and p[i][j])
						vis[j]=cnt,cur.pb(j);
				for(int j=0;j<int(cur.size());j++)
					answer[cur[j]][cur[(j+1)%int(cur.size())]]=answer[cur[(j+1)%int(cur.size())]][cur[j]]=1;
			}
		for(int i=0;i<n;i++)
			for(int j=0;j<n;j++)
				if(p[i][j] and vis[i]!=vis[j])
					return 0;
		build(answer);
		return 1;
	}
	return 0;
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 10 ms 1152 KB Output is correct
7 Correct 253 ms 22136 KB Output is correct

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 10 ms 1152 KB Output is correct
7 Correct 253 ms 22136 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 10 ms 1280 KB Output is correct
13 Correct 239 ms 22264 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 5 ms 768 KB Output is correct
17 Correct 115 ms 12152 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Incorrect 1 ms 256 KB Answer gives possible 1 while actual possible 0
20 Halted 0 ms 0 KB -

Subtask #3
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Incorrect 1 ms 256 KB Answer gives possible 1 while actual possible 0
5 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 62 ms 5880 KB Output is correct
5 Correct 241 ms 22136 KB Output is correct
6 Correct 249 ms 22080 KB Output is correct
7 Correct 258 ms 22264 KB Output is correct
8 Incorrect 1 ms 256 KB b[4][4] is not 0
9 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 10 ms 1152 KB Output is correct
7 Correct 253 ms 22136 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 10 ms 1280 KB Output is correct
13 Correct 239 ms 22264 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 5 ms 768 KB Output is correct
17 Correct 115 ms 12152 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Incorrect 1 ms 256 KB Answer gives possible 1 while actual possible 0
20 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 10 ms 1152 KB Output is correct
7 Correct 253 ms 22136 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 10 ms 1280 KB Output is correct
13 Correct 239 ms 22264 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 5 ms 768 KB Output is correct
17 Correct 115 ms 12152 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Incorrect 1 ms 256 KB Answer gives possible 1 while actual possible 0
20 Halted 0 ms 0 KB -