oj.uz

답안 #254200

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
254200 2020-07-29T13:57:42 Z PedroBigMan 게임 (IOI14_game) C++14
42 / 100
 1000 ms 888 KB 
#include "game.h"
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <string>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <queue>
#include <deque>
#include <list>
#include <iomanip>
#include <stdlib.h>
#include <time.h>
#include <cstring>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
#define REP(i,a,b) for(ll i=(ll) a; i<(ll) b; i++)
#define pb push_back
#define mp make_pair
#define pl pair<ll,ll>
#define ff first
#define ss second
#define whole(x) x.begin(),x.end()
#define DEBUG(i) cout<<"Pedro Is The Master "<<i<<endl
#define INF 500000000LL
#define EPS 0.00000001
#define pi 3.14159
ll N; 

struct hash_pair 
{ 
    template <class T1, class T2> 
    size_t operator() (pair<T1, T2> p) const
    {
        size_t hash1 = hash<T1>()(p.first); 
        size_t hash2 = hash<T2>()(p.second); 
        return (hash1 ^ hash2); 
    } 
};

unordered_set<pl,hash_pair> cut;
vector<bool> visited;

void initialize(int n) 
{
    N=(ll) n;
    REP(i,0,N) {visited.pb(false);}
}

void DFS(ll s)
{
    visited[s]=true;
    REP(i,0,N)
    {
        if(visited[i] || i==s) {continue;}
        if(cut.find(mp(s,i))!=cut.end() || cut.find(mp(i,s))!=cut.end()) {continue;}
        DFS(i);
    }
}

int hasEdge(int u, int v) 
{
    cut.insert(mp(u,v));
    REP(i,0,N) {visited[i]=false;}
    DFS(0);
    cut.erase(mp(u,v));
    bool connected=true;
    REP(i,0,N) {if(!visited[i]) {connected=false; break;}}
    if(connected) {cut.insert(mp(u,v)); return 0;}
    else {return 1;}
}

Subtask #1
15.0 / 15.0

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

Subtask #2
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Correct 0 ms 256 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 0 ms 256 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 1 ms 256 KB Output is correct
13 Correct 0 ms 256 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 0 ms 256 KB Output is correct
17 Correct 0 ms 256 KB Output is correct
18 Correct 0 ms 256 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 0 ms 256 KB Output is correct
21 Correct 0 ms 256 KB Output is correct
22 Correct 1 ms 256 KB Output is correct
23 Correct 0 ms 256 KB Output is correct
24 Correct 0 ms 256 KB Output is correct
25 Correct 8 ms 384 KB Output is correct
26 Correct 7 ms 384 KB Output is correct
27 Correct 8 ms 384 KB Output is correct
28 Correct 8 ms 384 KB Output is correct
29 Correct 7 ms 384 KB Output is correct
30 Correct 7 ms 384 KB Output is correct
31 Correct 7 ms 384 KB Output is correct
32 Correct 7 ms 384 KB Output is correct
33 Correct 7 ms 384 KB Output is correct
34 Correct 246 ms 504 KB Output is correct
35 Correct 260 ms 760 KB Output is correct
36 Correct 265 ms 504 KB Output is correct
37 Correct 257 ms 504 KB Output is correct
38 Correct 254 ms 632 KB Output is correct
39 Correct 247 ms 504 KB Output is correct
40 Correct 271 ms 504 KB Output is correct
41 Correct 240 ms 504 KB Output is correct
42 Correct 244 ms 504 KB Output is correct
43 Correct 748 ms 484 KB Output is correct
44 Correct 748 ms 632 KB Output is correct
45 Correct 525 ms 632 KB Output is correct
46 Correct 581 ms 504 KB Output is correct
47 Correct 525 ms 760 KB Output is correct
48 Correct 555 ms 504 KB Output is correct
49 Correct 504 ms 760 KB Output is correct
50 Correct 241 ms 504 KB Output is correct
51 Correct 262 ms 504 KB Output is correct
52 Correct 288 ms 760 KB Output is correct
53 Correct 278 ms 504 KB Output is correct
54 Correct 277 ms 764 KB Output is correct

Subtask #3
0 / 58.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Correct 0 ms 256 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 0 ms 256 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 0 ms 256 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 0 ms 256 KB Output is correct
17 Correct 0 ms 256 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 0 ms 256 KB Output is correct
21 Correct 1 ms 256 KB Output is correct
22 Correct 0 ms 256 KB Output is correct
23 Correct 1 ms 256 KB Output is correct
24 Correct 1 ms 256 KB Output is correct
25 Correct 8 ms 384 KB Output is correct
26 Correct 7 ms 384 KB Output is correct
27 Correct 8 ms 384 KB Output is correct
28 Correct 8 ms 384 KB Output is correct
29 Correct 7 ms 384 KB Output is correct
30 Correct 8 ms 384 KB Output is correct
31 Correct 7 ms 400 KB Output is correct
32 Correct 8 ms 384 KB Output is correct
33 Correct 7 ms 384 KB Output is correct
34 Correct 244 ms 504 KB Output is correct
35 Correct 255 ms 644 KB Output is correct
36 Correct 262 ms 504 KB Output is correct
37 Correct 248 ms 632 KB Output is correct
38 Correct 250 ms 504 KB Output is correct
39 Correct 242 ms 504 KB Output is correct
40 Correct 260 ms 504 KB Output is correct
41 Correct 239 ms 504 KB Output is correct
42 Correct 248 ms 632 KB Output is correct
43 Correct 744 ms 504 KB Output is correct
44 Correct 746 ms 564 KB Output is correct
45 Correct 518 ms 632 KB Output is correct
46 Correct 579 ms 504 KB Output is correct
47 Correct 530 ms 632 KB Output is correct
48 Correct 558 ms 888 KB Output is correct
49 Correct 511 ms 512 KB Output is correct
50 Correct 245 ms 632 KB Output is correct
51 Correct 268 ms 508 KB Output is correct
52 Correct 293 ms 632 KB Output is correct
53 Correct 293 ms 504 KB Output is correct
54 Correct 276 ms 504 KB Output is correct
55 Execution timed out 1091 ms 764 KB Time limit exceeded
56 Halted 0 ms 0 KB -