oj.uz

답안 #1080125

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1080125 2024-08-29T07:18:18 Z GrindMachine 슈퍼트리 잇기 (IOI20_supertrees) C++17
96 / 100
 154 ms 24188 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long int ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define pb push_back
#define endl '\n'
#define conts continue
#define sz(a) (int)a.size()
#define ff first
#define ss second
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; ++i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &x, T y){
    x = min(x,y);
}

template<typename T>
void amax(T &x, T y){
    x = max(x,y);
}

template<typename A,typename B>
string to_string(pair<A,B> p);

string to_string(const string &s){
    return "'"+s+"'";
}

string to_string(const char* s){
    return to_string((string)s);
}

string to_string(bool b){
    return b?"true":"false";
}

template<typename A>
string to_string(A v){
    string res = "{";
    trav(x,v){
        res += to_string(x)+",";
    }
    if(res.back() == ',') res.pop_back();
    res += "}";
    return res;
}

template<typename A,typename B>
string to_string(pair<A,B> p){
    return "("+to_string(p.ff)+","+to_string(p.ss)+")";
}

#define debug(x) cout << "[" << #x << "]: "; cout << to_string(x) << endl

const int MOD = 1e9 + 7;
const int N = 1e3 + 5;
const int inf1 = 1e9 + 5;
const ll inf2 = (ll)1e18 + 5;

#include "supertrees.h"

vector<int> par(N);

void create(int n){
	rep(i,n) par[i] = i;
}

int find(int u){
	if(u == par[u]) return u;
	else return par[u] = find(par[u]);
}

void merge(int u, int v){
	u = find(u), v = find(v);
	if(u == v) return;
	par[v] = u;
}

int construct(std::vector<std::vector<int>> a) {
	int n = a.size();
	vector<vector<int>> ans(n,vector<int>(n));
	create(n);

	rep(i,n){
		rep(j,n){
			if(a[i][j]){
				merge(i,j);
			}
		}
	}

	rep(i,n){
		rep(j,n){
			int x = a[i][j] > 0;
			int y = find(i) == find(j);
			if(x != y){
				return 0;
			}
		}
	}

	vector<int> group[n];
	rep(i,n) group[find(i)].pb(i);

	auto f = [&](int u, int v){
		ans[u][v] = ans[v][u] = 1;
	};

	rep(c,n){
		auto &nodes = group[c];
		if(nodes.empty()) conts;
		create(n);
		vector<int> cc[n];
		int m = sz(nodes);

		rep(i,m){
			rep(j,i){
				int u = nodes[i], v = nodes[j];
				if(a[u][v] == 1){
					merge(u,v);
				}
			}
		}

		rep(i,m){
			rep(j,i){
				int u = nodes[i], v = nodes[j];
				int x = a[u][v] == 1;
				int y = find(u) == find(v);
				if(x != y){
					return 0;
				}
			}
		}

		trav(u,nodes){
			cc[find(u)].pb(u);
		}

		vector<int> cyc;

		rep(id,n){
			if(cc[id].empty()) conts;
			auto &curr = cc[id];
			cyc.pb(curr[0]);
			rep(i,sz(curr)-1){
				f(curr[i],curr[i+1]);
			}
		}

		int siz = sz(cyc);
		if(siz == 2) return 0;

		if(siz > 1){
			rep(i,siz){
				f(cyc[i],cyc[(i+1)%siz]);
			}
		}
	}

	build(ans);
	return 1;

	// std::vector<std::vector<int>> answer;
	// for (int i = 0; i < n; i++) {
	// 	std::vector<int> row;
	// 	row.resize(n);
	// 	answer.push_back(row);
	// }
	// build(answer);
	// return 1;
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 6 ms 1328 KB Output is correct
7 Correct 136 ms 22036 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 6 ms 1328 KB Output is correct
7 Correct 136 ms 22036 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 6 ms 1116 KB Output is correct
13 Correct 123 ms 22228 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 62 ms 12044 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 29 ms 5788 KB Output is correct
21 Correct 129 ms 22192 KB Output is correct
22 Correct 118 ms 22080 KB Output is correct
23 Correct 138 ms 22096 KB Output is correct
24 Correct 117 ms 22100 KB Output is correct
25 Correct 53 ms 12112 KB Output is correct
26 Correct 50 ms 12112 KB Output is correct
27 Correct 135 ms 22040 KB Output is correct
28 Correct 130 ms 22096 KB Output is correct

Subtask #3
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 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 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 5 ms 1412 KB Output is correct
9 Correct 119 ms 24076 KB Output is correct
10 Correct 1 ms 600 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 5 ms 1348 KB Output is correct
13 Correct 122 ms 24144 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 63 ms 14076 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 31 ms 6224 KB Output is correct
22 Correct 123 ms 24148 KB Output is correct
23 Correct 123 ms 23944 KB Output is correct
24 Correct 154 ms 24072 KB Output is correct
25 Correct 55 ms 14164 KB Output is correct
26 Correct 52 ms 14224 KB Output is correct
27 Correct 118 ms 24148 KB Output is correct
28 Correct 142 ms 24188 KB Output is correct
29 Correct 54 ms 14164 KB Output is correct

Subtask #4
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 43 ms 6064 KB Output is correct
5 Correct 121 ms 22044 KB Output is correct
6 Correct 121 ms 22100 KB Output is correct
7 Correct 152 ms 22100 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 32 ms 5712 KB Output is correct
10 Correct 120 ms 22044 KB Output is correct
11 Correct 118 ms 22096 KB Output is correct
12 Correct 127 ms 22096 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 29 ms 5692 KB Output is correct
17 Correct 124 ms 22100 KB Output is correct
18 Correct 119 ms 22096 KB Output is correct
19 Correct 119 ms 22100 KB Output is correct
20 Correct 116 ms 22112 KB Output is correct

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 6 ms 1328 KB Output is correct
7 Correct 136 ms 22036 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 6 ms 1116 KB Output is correct
13 Correct 123 ms 22228 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 62 ms 12044 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 29 ms 5788 KB Output is correct
21 Correct 129 ms 22192 KB Output is correct
22 Correct 118 ms 22080 KB Output is correct
23 Correct 138 ms 22096 KB Output is correct
24 Correct 117 ms 22100 KB Output is correct
25 Correct 53 ms 12112 KB Output is correct
26 Correct 50 ms 12112 KB Output is correct
27 Correct 135 ms 22040 KB Output is correct
28 Correct 130 ms 22096 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 5 ms 1412 KB Output is correct
37 Correct 119 ms 24076 KB Output is correct
38 Correct 1 ms 600 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 5 ms 1348 KB Output is correct
41 Correct 122 ms 24144 KB Output is correct
42 Correct 0 ms 344 KB Output is correct
43 Correct 1 ms 348 KB Output is correct
44 Correct 3 ms 860 KB Output is correct
45 Correct 63 ms 14076 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 1 ms 348 KB Output is correct
48 Correct 1 ms 344 KB Output is correct
49 Correct 31 ms 6224 KB Output is correct
50 Correct 123 ms 24148 KB Output is correct
51 Correct 123 ms 23944 KB Output is correct
52 Correct 154 ms 24072 KB Output is correct
53 Correct 55 ms 14164 KB Output is correct
54 Correct 52 ms 14224 KB Output is correct
55 Correct 118 ms 24148 KB Output is correct
56 Correct 142 ms 24188 KB Output is correct
57 Correct 54 ms 14164 KB Output is correct
58 Correct 1 ms 344 KB Output is correct
59 Correct 0 ms 348 KB Output is correct
60 Correct 3 ms 860 KB Output is correct
61 Correct 63 ms 14204 KB Output is correct
62 Correct 0 ms 348 KB Output is correct
63 Correct 1 ms 348 KB Output is correct
64 Correct 1 ms 348 KB Output is correct
65 Correct 29 ms 6408 KB Output is correct
66 Correct 52 ms 14164 KB Output is correct
67 Correct 50 ms 14164 KB Output is correct
68 Correct 51 ms 14160 KB Output is correct
69 Correct 63 ms 14256 KB Output is correct

Subtask #6
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 6 ms 1328 KB Output is correct
7 Correct 136 ms 22036 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 6 ms 1116 KB Output is correct
13 Correct 123 ms 22228 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 62 ms 12044 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 29 ms 5788 KB Output is correct
21 Correct 129 ms 22192 KB Output is correct
22 Correct 118 ms 22080 KB Output is correct
23 Correct 138 ms 22096 KB Output is correct
24 Correct 117 ms 22100 KB Output is correct
25 Correct 53 ms 12112 KB Output is correct
26 Correct 50 ms 12112 KB Output is correct
27 Correct 135 ms 22040 KB Output is correct
28 Correct 130 ms 22096 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 5 ms 1412 KB Output is correct
37 Correct 119 ms 24076 KB Output is correct
38 Correct 1 ms 600 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 5 ms 1348 KB Output is correct
41 Correct 122 ms 24144 KB Output is correct
42 Correct 0 ms 344 KB Output is correct
43 Correct 1 ms 348 KB Output is correct
44 Correct 3 ms 860 KB Output is correct
45 Correct 63 ms 14076 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 1 ms 348 KB Output is correct
48 Correct 1 ms 344 KB Output is correct
49 Correct 31 ms 6224 KB Output is correct
50 Correct 123 ms 24148 KB Output is correct
51 Correct 123 ms 23944 KB Output is correct
52 Correct 154 ms 24072 KB Output is correct
53 Correct 55 ms 14164 KB Output is correct
54 Correct 52 ms 14224 KB Output is correct
55 Correct 118 ms 24148 KB Output is correct
56 Correct 142 ms 24188 KB Output is correct
57 Correct 54 ms 14164 KB Output is correct
58 Correct 1 ms 344 KB Output is correct
59 Correct 0 ms 344 KB Output is correct
60 Correct 1 ms 344 KB Output is correct
61 Correct 43 ms 6064 KB Output is correct
62 Correct 121 ms 22044 KB Output is correct
63 Correct 121 ms 22100 KB Output is correct
64 Correct 152 ms 22100 KB Output is correct
65 Correct 1 ms 344 KB Output is correct
66 Correct 32 ms 5712 KB Output is correct
67 Correct 120 ms 22044 KB Output is correct
68 Correct 118 ms 22096 KB Output is correct
69 Correct 127 ms 22096 KB Output is correct
70 Correct 1 ms 348 KB Output is correct
71 Correct 0 ms 348 KB Output is correct
72 Correct 0 ms 348 KB Output is correct
73 Correct 29 ms 5692 KB Output is correct
74 Correct 124 ms 22100 KB Output is correct
75 Correct 119 ms 22096 KB Output is correct
76 Correct 119 ms 22100 KB Output is correct
77 Correct 116 ms 22112 KB Output is correct
78 Correct 1 ms 344 KB Output is correct
79 Correct 0 ms 348 KB Output is correct
80 Correct 3 ms 860 KB Output is correct
81 Correct 63 ms 14204 KB Output is correct
82 Correct 0 ms 348 KB Output is correct
83 Correct 1 ms 348 KB Output is correct
84 Correct 1 ms 348 KB Output is correct
85 Correct 29 ms 6408 KB Output is correct
86 Correct 52 ms 14164 KB Output is correct
87 Correct 50 ms 14164 KB Output is correct
88 Correct 51 ms 14160 KB Output is correct
89 Correct 63 ms 14256 KB Output is correct
90 Correct 1 ms 344 KB Output is correct
91 Correct 0 ms 348 KB Output is correct
92 Correct 3 ms 860 KB Output is correct
93 Correct 57 ms 14164 KB Output is correct
94 Incorrect 0 ms 348 KB Answer gives possible 1 while actual possible 0
95 Halted 0 ms 0 KB -