oj.uz

답안 #786046

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
786046 2023-07-17T23:16:21 Z horiiseun 게임 (IOI14_game) C++17
100 / 100
 335 ms 15820 KB 
#include <iostream>
#include <vector>
#include <tuple>
#include <queue>
#include <stack>
#include <deque>
#include <set>
#include <map>
#include <cmath>
#include <random>
#include <string>
#include <cassert>
#include <climits>
#include <algorithm>
#include <unordered_set>
#include <unordered_map>
#include "game.h"
using namespace std;

#define ll long long
#define f first
#define s second

void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }

template<typename A> void __print(const A &x);
template<typename A, typename B> void __print(const pair<A, B> &p);
template<typename... A> void __print(const tuple<A...> &t);
template<typename T> void __print(stack<T> s);
template<typename T> void __print(queue<T> q);
template<typename T, typename... U> void __print(priority_queue<T, U...> q);

template<typename A> void __print(const A &x) {
    bool first = true;
    cerr << '{';
    for (const auto &i : x) {
        cerr << (first ? "" : ","), __print(i);
        first = false;
    }
    cerr << '}';
}

template<typename A, typename B> void __print(const pair<A, B> &p) {
    cerr << '(';
    __print(p.f);
    cerr << ',';
    __print(p.s);
    cerr << ')';
}

template<typename... A> void __print(const tuple<A...> &t) {
    bool first = true;
    cerr << '(';
    apply([&first] (const auto &...args) { ((cerr << (first ? "" : ","), __print(args), first = false), ...); }, t);
    cerr << ')';
}

template<typename T> void __print(stack<T> s) {
    vector<T> debugVector;
    while (!s.empty()) {
        T t = s.top();
        debugVector.push_back(t);
        s.pop();
    }
    reverse(debugVector.begin(), debugVector.end());
    __print(debugVector);
}

template<typename T> void __print(queue<T> q) {
    vector<T> debugVector;
    while (!q.empty()) {
        T t = q.front();
        debugVector.push_back(t);
        q.pop();
    }
    __print(debugVector);
}

template<typename T, typename... U> void __print(priority_queue<T, U...> q) {
    vector<T> debugVector;
    while (!q.empty()) {
        T t = q.top();
        debugVector.push_back(t);
        q.pop();
    }
    __print(debugVector);
}

void _print() { cerr << "]\n"; }

template <typename Head, typename... Tail> void _print(const Head &H, const Tail &...T) {
    __print(H);
    if (sizeof...(T)) cerr << ", ";
    _print(T...);
}

#ifdef DEBUG
	#define D(...) cerr << "Line: " << __LINE__ << " [" << #__VA_ARGS__ << "] = ["; _print(__VA_ARGS__)
#else
	#define D(...)
#endif

int seen[1505][1505];
vector<int> cnt;

void initialize(int n) {
	for (int i = 0; i <= n; i++) {
		cnt.push_back(i);
	}
	fill(&seen[0][0], &seen[0][0] + sizeof(seen) / sizeof(seen[0][0]), -1);
}

int hasEdge(int u, int v) {
	if (u > v) swap(u, v);
	if (seen[u][v] != -1) return seen[u][v];
	seen[u][v] = !(cnt[v] > 1);
	cnt[v]--;
	return seen[u][v];
}

Subtask #1
15.0 / 15.0

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

Subtask #2
27.0 / 27.0

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

Subtask #3
58.0 / 58.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 9172 KB Output is correct
2 Correct 3 ms 9172 KB Output is correct
3 Correct 3 ms 9044 KB Output is correct
4 Correct 3 ms 9108 KB Output is correct
5 Correct 4 ms 9172 KB Output is correct
6 Correct 3 ms 9172 KB Output is correct
7 Correct 4 ms 9172 KB Output is correct
8 Correct 3 ms 9172 KB Output is correct
9 Correct 4 ms 9172 KB Output is correct
10 Correct 3 ms 9172 KB Output is correct
11 Correct 4 ms 9172 KB Output is correct
12 Correct 3 ms 9172 KB Output is correct
13 Correct 3 ms 9172 KB Output is correct
14 Correct 3 ms 9172 KB Output is correct
15 Correct 3 ms 9172 KB Output is correct
16 Correct 4 ms 9172 KB Output is correct
17 Correct 4 ms 9128 KB Output is correct
18 Correct 3 ms 9172 KB Output is correct
19 Correct 3 ms 9172 KB Output is correct
20 Correct 3 ms 9172 KB Output is correct
21 Correct 3 ms 9172 KB Output is correct
22 Correct 3 ms 9172 KB Output is correct
23 Correct 3 ms 9172 KB Output is correct
24 Correct 3 ms 9172 KB Output is correct
25 Correct 3 ms 9172 KB Output is correct
26 Correct 3 ms 9172 KB Output is correct
27 Correct 3 ms 9172 KB Output is correct
28 Correct 5 ms 9144 KB Output is correct
29 Correct 4 ms 9172 KB Output is correct
30 Correct 4 ms 9172 KB Output is correct
31 Correct 3 ms 9172 KB Output is correct
32 Correct 3 ms 9172 KB Output is correct
33 Correct 3 ms 9172 KB Output is correct
34 Correct 4 ms 9172 KB Output is correct
35 Correct 4 ms 9172 KB Output is correct
36 Correct 4 ms 9172 KB Output is correct
37 Correct 4 ms 9172 KB Output is correct
38 Correct 4 ms 9172 KB Output is correct
39 Correct 4 ms 9172 KB Output is correct
40 Correct 4 ms 9172 KB Output is correct
41 Correct 4 ms 9172 KB Output is correct
42 Correct 4 ms 9180 KB Output is correct
43 Correct 4 ms 9172 KB Output is correct
44 Correct 4 ms 9180 KB Output is correct
45 Correct 4 ms 9172 KB Output is correct
46 Correct 4 ms 9172 KB Output is correct
47 Correct 4 ms 9172 KB Output is correct
48 Correct 4 ms 9172 KB Output is correct
49 Correct 4 ms 9172 KB Output is correct
50 Correct 4 ms 9172 KB Output is correct
51 Correct 4 ms 9172 KB Output is correct
52 Correct 4 ms 9176 KB Output is correct
53 Correct 4 ms 9172 KB Output is correct
54 Correct 4 ms 9172 KB Output is correct
55 Correct 35 ms 9860 KB Output is correct
56 Correct 29 ms 9916 KB Output is correct
57 Correct 29 ms 9872 KB Output is correct
58 Correct 29 ms 9932 KB Output is correct
59 Correct 29 ms 9940 KB Output is correct
60 Correct 29 ms 9932 KB Output is correct
61 Correct 29 ms 9880 KB Output is correct
62 Correct 36 ms 9848 KB Output is correct
63 Correct 29 ms 9940 KB Output is correct
64 Correct 28 ms 9912 KB Output is correct
65 Correct 28 ms 9848 KB Output is correct
66 Correct 31 ms 9900 KB Output is correct
67 Correct 29 ms 9892 KB Output is correct
68 Correct 35 ms 9868 KB Output is correct
69 Correct 29 ms 9940 KB Output is correct
70 Correct 28 ms 9944 KB Output is correct
71 Correct 30 ms 9932 KB Output is correct
72 Correct 29 ms 9932 KB Output is correct
73 Correct 29 ms 9932 KB Output is correct
74 Correct 29 ms 9840 KB Output is correct
75 Correct 28 ms 9916 KB Output is correct
76 Correct 61 ms 10860 KB Output is correct
77 Correct 62 ms 11004 KB Output is correct
78 Correct 62 ms 10848 KB Output is correct
79 Correct 62 ms 10828 KB Output is correct
80 Correct 62 ms 10864 KB Output is correct
81 Correct 62 ms 10864 KB Output is correct
82 Correct 62 ms 10828 KB Output is correct
83 Correct 62 ms 10832 KB Output is correct
84 Correct 62 ms 10916 KB Output is correct
85 Correct 105 ms 12244 KB Output is correct
86 Correct 107 ms 12236 KB Output is correct
87 Correct 106 ms 12236 KB Output is correct
88 Correct 110 ms 12220 KB Output is correct
89 Correct 106 ms 12228 KB Output is correct
90 Correct 107 ms 12176 KB Output is correct
91 Correct 121 ms 12228 KB Output is correct
92 Correct 108 ms 12236 KB Output is correct
93 Correct 114 ms 12224 KB Output is correct
94 Correct 256 ms 15732 KB Output is correct
95 Correct 237 ms 15820 KB Output is correct
96 Correct 335 ms 15740 KB Output is correct
97 Correct 246 ms 15704 KB Output is correct
98 Correct 234 ms 15772 KB Output is correct
99 Correct 269 ms 15796 KB Output is correct
100 Correct 311 ms 15712 KB Output is correct