oj.uz

답안 #219262

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
219262 2020-04-04T21:02:53 Z thebes 로카히아 유적 (FXCUP4_lokahia) C++17
0 / 100
 1000 ms 768 KB 
#include "lokahia.h"
#include <bits/stdc++.h>
using namespace std;

const int MN = 205;
mt19937 mt(time(0));
int rng(int l,int r){return (mt()%(r-l+1))+l;}
set<int> elem[MN], bel[MN], adj[MN]; set<pair<int,int>> use;
int ord[MN], a, b;

int FindBase(int N){
    for(int i=0;i<min(99,N*(N+1)/2);i++){
        int x = rng(0,N-1), y = rng(0,N-1);
        while(x==y||use.count({x,y})){
            x = rng(0,N-1), y =rng(0,N-1);
        }
        use.insert({x,y});
        int rt = CollectRelics(x, y);
        if(rt!=-1){
            elem[rt].insert(x);
            elem[rt].insert(y);
            bel[x].insert(rt);
            bel[y].insert(rt);
        }
        else{
            adj[x].insert(y);
            adj[y].insert(x);
        }
    }
    for(int i=0;i<N;i++) ord[i]=i;
    sort(ord,ord+N,[](int i,int j){return elem[i].size()>elem[j].size();});
    a=ord[0], b=ord[1];
    int Q = min(99,N*(N+1)/2);
    int rt = CollectRelics(a,b);
    if(rt==-1&&elem[b].size()<Q/4-5) rt=a;
    if(rt!=-1){
        int cnt = 1;
        for(int i=0;i<N;i++){
            if(i!=rt&&CollectRelics(rt,i)!=-1) cnt++;
        }
        if(cnt>(N/2)) return rt;
        else return -1;
    }
    else{
        bel[a].insert(a); bel[b].insert(b);
        adj[a].insert(b); adj[b].insert(a);
        int ca = bel[a].size(), cb = bel[b].size();
        for(int i=0;i<N;i++){
            int chka=1, chkb=0;
            for(auto v : adj[i]){
                if(bel[a].count(v)) chka=0;
                if(bel[b].count(v)) chkb=0;
            }
            if(bel[a].count(i)) chka=0;
            if(bel[b].count(i)) chkb=0;
            if(chka&&CollectRelics(a,i)!=-1) ca++;
            if(chkb&&CollectRelics(b,i)!=-1) cb++;
        }
        if(ca>(N/2)) return a;
        else if(cb>(N/2)) return b;
        else return -1;
    }
}

Compilation message

lokahia.cpp: In function 'int FindBase(int)':
lokahia.cpp:35:30: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     if(rt==-1&&elem[b].size()<Q/4-5) rt=a;
                ~~~~~~~~~~~~~~^~~~~~

Subtask #1
0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 640 KB Correct : C = 218
2 Correct 5 ms 640 KB Correct : C = 299
3 Correct 5 ms 768 KB Correct : C = 298
4 Correct 5 ms 640 KB Correct : C = 298
5 Correct 5 ms 640 KB Correct : C = 298
6 Correct 5 ms 640 KB Correct : C = 298
7 Correct 5 ms 640 KB Correct : C = 299
8 Correct 6 ms 768 KB Correct : C = 298
9 Correct 7 ms 768 KB Correct : C = 299
10 Correct 5 ms 768 KB Correct : C = 298
11 Correct 5 ms 640 KB Correct : C = 299
12 Correct 5 ms 692 KB Correct : C = 297
13 Correct 5 ms 512 KB Correct : C = 20
14 Correct 5 ms 640 KB Correct : C = 298
15 Correct 5 ms 640 KB Correct : C = 219
16 Correct 5 ms 640 KB Correct : C = 219
17 Execution timed out 1094 ms 488 KB Time limit exceeded
18 Correct 6 ms 640 KB Correct : C = 299
19 Correct 6 ms 640 KB Correct : C = 219
20 Correct 5 ms 640 KB Correct : C = 218
21 Incorrect 5 ms 640 KB Wrong
22 Correct 5 ms 640 KB Correct : C = 219
23 Correct 5 ms 640 KB Correct : C = 219
24 Correct 5 ms 692 KB Correct : C = 299
25 Correct 5 ms 640 KB Correct : C = 218
26 Incorrect 5 ms 640 KB Wrong
27 Correct 5 ms 640 KB Correct : C = 218