oj.uz

답안 #388474

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
388474 2021-04-11T16:09:40 Z ACmachine 게임 (IOI14_game) C++17
100 / 100
 669 ms 25272 KB 
#include "game.h"
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;

template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T, typename U> using ordered_map = tree<T, U, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

typedef long long ll;
typedef long double ld;

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

typedef vector<int> vi;
typedef vector<ll> vll;

#define FOR(i,j,k,in) for(int i=(j); i < (k);i+=in)
#define FORD(i,j,k,in) for(int i=(j); i >=(k);i-=in)
#define REP(i,b) FOR(i,0,b,1)
#define REPD(i,b) FORD(i,b,0,1)
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(x) begin(x), end(x)
#define MANY_TESTS int tcase; cin >> tcase; while(tcase--)

const double EPS = 1e-9;
const int MOD = 1e9+7;
const ll INFF = 1e18;
const int INF = 1e9;
const ld PI = acos((ld)-1);
const vi dy = {1, 0, -1, 0, -1, 1, 1, -1};
const vi dx = {0, 1, 0, -1, -1, 1, -1, 1};

void DBG(){cout << "]" << endl;}
template<typename T, typename ...U> void DBG(const T& head, const U... args){ cout << head << "; "; DBG(args...); }
#define dbg(...) cout << "Line(" << __LINE__ << ") -> [" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__);
#define chk() cout << "Check at line(" << __LINE__ << ") hit." << endl;

template<class T, unsigned int U>
ostream& operator<<(ostream& out, const array<T, U> &v){out << "[";  REP(i, U) out << v[i] << ", ";  out << "]"; return out;}
template <class T, class U>
ostream& operator<<(ostream& out, const pair<T, U> &par) {out << "[" << par.first << ";" << par.second << "]"; return out;}
template <class T>
ostream& operator<<(ostream& out, const multiset<T> &cont) { out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template <class T, class U>
ostream& operator<<(ostream& out, const map<T, U> &cont) {out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template<class T>
ostream& operator<<(ostream& out, const vector<T> &v){ out << "[";  REP(i, v.size()) out << v[i] << ", ";  out << "]"; return out;}

template<class T>
istream& operator>>(istream& in, vector<T> &v){ for(auto &x : v) in >> x; return in; }


int n;
int unasked_edges[1500][1500];
int comp[1500];


void initialize(int N) {
    memset(unasked_edges, 0, sizeof(unasked_edges));
    n = N;
    REP(i, n) comp[i] = i;
    REP(i, n){
        REP(j ,n){
            if(i == j) continue;
            unasked_edges[i][j]++;
        }
    }
}

int hasEdge(int u, int v) {

    int ans = 1;
    int a = comp[u];
    int b = comp[v];
    if(a == b) return 1;
    unasked_edges[a][v]--;
    unasked_edges[b][u]--;
    REP(i, n){
        if(comp[i] == b){
            if(unasked_edges[a][i]){
                ans = 0;
                break;
            }
        }
    }
    if(ans){
        REP(i, n){
            if(comp[i] == b)
                comp[i] = a;
        }
        REP(i, n){
            unasked_edges[a][i] += unasked_edges[b][i];
        }
    }
    return ans;
}

Subtask #1
15.0 / 15.0

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

Subtask #2
27.0 / 27.0

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

Subtask #3
58.0 / 58.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 9036 KB Output is correct
2 Correct 4 ms 9036 KB Output is correct
3 Correct 4 ms 9036 KB Output is correct
4 Correct 4 ms 9036 KB Output is correct
5 Correct 4 ms 9120 KB Output is correct
6 Correct 4 ms 9036 KB Output is correct
7 Correct 4 ms 9064 KB Output is correct
8 Correct 4 ms 9036 KB Output is correct
9 Correct 4 ms 9036 KB Output is correct
10 Correct 4 ms 9036 KB Output is correct
11 Correct 4 ms 9036 KB Output is correct
12 Correct 4 ms 9036 KB Output is correct
13 Correct 4 ms 9036 KB Output is correct
14 Correct 4 ms 9036 KB Output is correct
15 Correct 4 ms 9036 KB Output is correct
16 Correct 4 ms 9036 KB Output is correct
17 Correct 4 ms 9116 KB Output is correct
18 Correct 5 ms 9088 KB Output is correct
19 Correct 4 ms 9040 KB Output is correct
20 Correct 4 ms 9036 KB Output is correct
21 Correct 4 ms 9048 KB Output is correct
22 Correct 4 ms 9036 KB Output is correct
23 Correct 4 ms 9036 KB Output is correct
24 Correct 4 ms 9036 KB Output is correct
25 Correct 4 ms 9028 KB Output is correct
26 Correct 4 ms 9036 KB Output is correct
27 Correct 4 ms 9036 KB Output is correct
28 Correct 5 ms 9036 KB Output is correct
29 Correct 5 ms 9096 KB Output is correct
30 Correct 4 ms 9036 KB Output is correct
31 Correct 5 ms 9052 KB Output is correct
32 Correct 4 ms 9036 KB Output is correct
33 Correct 4 ms 9036 KB Output is correct
34 Correct 5 ms 9036 KB Output is correct
35 Correct 5 ms 9120 KB Output is correct
36 Correct 5 ms 9068 KB Output is correct
37 Correct 5 ms 9036 KB Output is correct
38 Correct 6 ms 9036 KB Output is correct
39 Correct 5 ms 9036 KB Output is correct
40 Correct 5 ms 9120 KB Output is correct
41 Correct 5 ms 9036 KB Output is correct
42 Correct 5 ms 9036 KB Output is correct
43 Correct 6 ms 9036 KB Output is correct
44 Correct 5 ms 9036 KB Output is correct
45 Correct 5 ms 9120 KB Output is correct
46 Correct 5 ms 9036 KB Output is correct
47 Correct 5 ms 9036 KB Output is correct
48 Correct 5 ms 9036 KB Output is correct
49 Correct 7 ms 9036 KB Output is correct
50 Correct 5 ms 9036 KB Output is correct
51 Correct 5 ms 9036 KB Output is correct
52 Correct 5 ms 9036 KB Output is correct
53 Correct 5 ms 9052 KB Output is correct
54 Correct 5 ms 9036 KB Output is correct
55 Correct 59 ms 9776 KB Output is correct
56 Correct 60 ms 9832 KB Output is correct
57 Correct 59 ms 9776 KB Output is correct
58 Correct 62 ms 9848 KB Output is correct
59 Correct 60 ms 9828 KB Output is correct
60 Correct 59 ms 9752 KB Output is correct
61 Correct 61 ms 9900 KB Output is correct
62 Correct 60 ms 9832 KB Output is correct
63 Correct 62 ms 9796 KB Output is correct
64 Correct 75 ms 9792 KB Output is correct
65 Correct 62 ms 9756 KB Output is correct
66 Correct 62 ms 9872 KB Output is correct
67 Correct 62 ms 9796 KB Output is correct
68 Correct 63 ms 9772 KB Output is correct
69 Correct 63 ms 9796 KB Output is correct
70 Correct 63 ms 9868 KB Output is correct
71 Correct 55 ms 9792 KB Output is correct
72 Correct 54 ms 9796 KB Output is correct
73 Correct 54 ms 9800 KB Output is correct
74 Correct 54 ms 9760 KB Output is correct
75 Correct 54 ms 9924 KB Output is correct
76 Correct 142 ms 10760 KB Output is correct
77 Correct 145 ms 10820 KB Output is correct
78 Correct 145 ms 10820 KB Output is correct
79 Correct 143 ms 10760 KB Output is correct
80 Correct 141 ms 10876 KB Output is correct
81 Correct 144 ms 10812 KB Output is correct
82 Correct 142 ms 10772 KB Output is correct
83 Correct 141 ms 10844 KB Output is correct
84 Correct 142 ms 10808 KB Output is correct
85 Correct 259 ms 12100 KB Output is correct
86 Correct 257 ms 12196 KB Output is correct
87 Correct 260 ms 12100 KB Output is correct
88 Correct 259 ms 12100 KB Output is correct
89 Correct 263 ms 12128 KB Output is correct
90 Correct 255 ms 12152 KB Output is correct
91 Correct 255 ms 12104 KB Output is correct
92 Correct 260 ms 12232 KB Output is correct
93 Correct 264 ms 12100 KB Output is correct
94 Correct 635 ms 20492 KB Output is correct
95 Correct 657 ms 25108 KB Output is correct
96 Correct 669 ms 25248 KB Output is correct
97 Correct 632 ms 25056 KB Output is correct
98 Correct 615 ms 25156 KB Output is correct
99 Correct 626 ms 25272 KB Output is correct
100 Correct 644 ms 25044 KB Output is correct