oj.uz

답안 #783924

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
783924 2023-07-15T12:25:32 Z tolbi 게임 (IOI14_game) C++17
100 / 100
 271 ms 16588 KB 
#pragma optimize("Bismillahirrahmanirrahim")
//█▀█─█──█──█▀█─█─█
//█▄█─█──█──█▄█─█■█
//█─█─█▄─█▄─█─█─█─█
//Allahuekber
//ahmet23 orz...
//FatihSultanMehmedHan
//YavuzSultanSelimHan
//AbdulhamidHan
//Sani buyuk Osman Pasa Plevneden cikmam diyor.
#define author tolbi
#include<bits/stdc++.h>
using namespace std;
template<typename X, typename Y> ostream& operator<<(ostream& os, pair<X,Y> pr){return os<<pr.first<<" "<<pr.second;}
ostream& operator<<(ostream& os, bool bl){return os<<(int32_t)bl;}
template<typename X> ostream& operator<<(ostream& os, vector<X> v){for(auto &it : v) os<<it<<" ";return os;}
template<typename X, size_t Y> ostream& operator<<(ostream& os, array<X,Y> v){for(auto &it : v) os<<it<<" ";return os;}
#define deci(x) int x;cin>>x;
#define endl '\n'
#define decstr(x) string x;cin>>x;
#define sortarr(x) sort(x.begin(), x.end())
#define sortrarr(x) sort(x.rbegin(), x.rend())
#define rev(x) reverse(x.begin(), x.end())
#define tol(bi) (1LL<<((int)(bi)))
typedef long long ll;
const ll INF = INT_MAX;
const int MOD = 1e9+7;
mt19937 ayahya(chrono::high_resolution_clock().now().time_since_epoch().count());
#include "game.h"
vector<vector<int>> ara;
vector<int> par;
vector<int> sz;
int find_par(int node){
	if (par[node]==node) return node;
	return par[node]=find_par(par[node]);
}
void initialize(int n) {
	ara.resize(n,vector<int>(n,0));
	par.resize(n);
	iota(par.begin(), par.end(), 0);
	sz.resize(n,1);
}
int hasEdge(int u, int v) {
	if (find_par(u)==find_par(v)){
		return 0;
	}
	u=find_par(u);
	v=find_par(v);
	if (sz[u]>sz[v]) swap(u,v);
	if (ara[u][v]==sz[u]*sz[v]-1){
		par[v]=u;
		sz[u]+=sz[v];
		sz[v]=0;
		for (int i = 0; i < par.size(); ++i)
		{
			if (find_par(i)==u || find_par(i)!=i) continue;
			ara[u][i]+=ara[v][i];
			ara[i][u]+=ara[i][v];
			ara[v][i]=ara[i][v]=0;
			ara[i][v]=ara[v][i]=0;
		}
		return 1;
	}
	else {
		ara[u][v]++;
		ara[v][u]++;
		return 0;
	}
}

Compilation message

game.cpp:1: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
    1 | #pragma optimize("Bismillahirrahmanirrahim")
      | 
game.cpp: In function 'int hasEdge(int, int)':
game.cpp:54:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   54 |   for (int i = 0; i < par.size(); ++i)
      |                   ~~^~~~~~~~~~~~

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct

Subtask #2
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 300 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 1 ms 340 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 1 ms 340 KB Output is correct
44 Correct 1 ms 340 KB Output is correct
45 Correct 1 ms 340 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 1 ms 340 KB Output is correct
48 Correct 1 ms 340 KB Output is correct
49 Correct 1 ms 340 KB Output is correct
50 Correct 2 ms 340 KB Output is correct
51 Correct 1 ms 340 KB Output is correct
52 Correct 1 ms 340 KB Output is correct
53 Correct 1 ms 340 KB Output is correct
54 Correct 1 ms 340 KB Output is correct

Subtask #3
58.0 / 58.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 304 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 1 ms 340 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 1 ms 340 KB Output is correct
44 Correct 1 ms 344 KB Output is correct
45 Correct 1 ms 340 KB Output is correct
46 Correct 2 ms 340 KB Output is correct
47 Correct 1 ms 340 KB Output is correct
48 Correct 1 ms 340 KB Output is correct
49 Correct 1 ms 340 KB Output is correct
50 Correct 1 ms 340 KB Output is correct
51 Correct 1 ms 340 KB Output is correct
52 Correct 1 ms 340 KB Output is correct
53 Correct 1 ms 340 KB Output is correct
54 Correct 1 ms 340 KB Output is correct
55 Correct 27 ms 2032 KB Output is correct
56 Correct 27 ms 2048 KB Output is correct
57 Correct 28 ms 2072 KB Output is correct
58 Correct 27 ms 2096 KB Output is correct
59 Correct 28 ms 2132 KB Output is correct
60 Correct 27 ms 2092 KB Output is correct
61 Correct 28 ms 2132 KB Output is correct
62 Correct 27 ms 2120 KB Output is correct
63 Correct 28 ms 2072 KB Output is correct
64 Correct 26 ms 2100 KB Output is correct
65 Correct 27 ms 2124 KB Output is correct
66 Correct 28 ms 2124 KB Output is correct
67 Correct 28 ms 2040 KB Output is correct
68 Correct 28 ms 2100 KB Output is correct
69 Correct 30 ms 2072 KB Output is correct
70 Correct 28 ms 2124 KB Output is correct
71 Correct 27 ms 2108 KB Output is correct
72 Correct 27 ms 2104 KB Output is correct
73 Correct 27 ms 2112 KB Output is correct
74 Correct 27 ms 2048 KB Output is correct
75 Correct 27 ms 2020 KB Output is correct
76 Correct 68 ms 4428 KB Output is correct
77 Correct 62 ms 4412 KB Output is correct
78 Correct 63 ms 4428 KB Output is correct
79 Correct 63 ms 4428 KB Output is correct
80 Correct 67 ms 4428 KB Output is correct
81 Correct 64 ms 4384 KB Output is correct
82 Correct 64 ms 4432 KB Output is correct
83 Correct 63 ms 4380 KB Output is correct
84 Correct 63 ms 4412 KB Output is correct
85 Correct 109 ms 7564 KB Output is correct
86 Correct 116 ms 8184 KB Output is correct
87 Correct 122 ms 8100 KB Output is correct
88 Correct 126 ms 8180 KB Output is correct
89 Correct 117 ms 8140 KB Output is correct
90 Correct 114 ms 8096 KB Output is correct
91 Correct 116 ms 8196 KB Output is correct
92 Correct 114 ms 8112 KB Output is correct
93 Correct 120 ms 8152 KB Output is correct
94 Correct 258 ms 16380 KB Output is correct
95 Correct 263 ms 16460 KB Output is correct
96 Correct 258 ms 16440 KB Output is correct
97 Correct 271 ms 16492 KB Output is correct
98 Correct 264 ms 16472 KB Output is correct
99 Correct 264 ms 16588 KB Output is correct
100 Correct 259 ms 16464 KB Output is correct