oj.uz

Submission #247309

# Submission time Handle Problem Language Result Execution time Memory
247309 2020-07-11T08:42:27 Z tqbfjotld Lokahian Relics (FXCUP4_lokahia) C++17
0 / 100
 7 ms 896 KB 
#include "lokahia.h"
#include <bits/stdc++.h>
using namespace std;

int NN;

vector<int> thing[205];
int qLim = 400;
int p[205];
int queried[205][205];
bool vis[205];
int root(int a){
return p[a]==a?a:p[a]=root(p[a]);
}
priority_queue<pair<int,int>,vector<pair<int,int> >,greater<pair<int,int> > > pq;
int sz[205];

int queryCount = 0;

int query(int a, int b){
    if (queryCount>=qLim){
        return -1;
    }
    if (a==b) return a;
    if (a<0 || a>=NN || b<0 || b>=NN) return 1/0;
    if (queried[a][b]!=-1) return queried[a][b];
    int res = CollectRelics(a,b);
    queryCount++;
    if (res!=-1){
        thing[res].push_back(a);
        thing[res].push_back(b);
        //printf("add edge %d %d, %d %d\n",res,a,res,b);
    }
    queried[a][b] = res;
    return res;
}

int dfs(int node){
    vis[node] = true;
    int res = 1;
    for (auto x : thing[node]){
        if (!vis[x]){
            res += dfs(x);
        }
    }
    return res;
}

int FindBase(int N){
    memset(queried,-1,sizeof(queried));
    NN = N;
    if (N==1) return 0;
	for (int x = 0; x<N; x++){
        pq.push({1,x});
        p[x] = x;
	}
	int mn = -1;
	vector<int> mns;
    while (!pq.empty()){
        if (pq.size()<3){
            if (pq.size()==1) {mns.push_back(pq.top().second);pq.pop();}
            else{
                auto a = pq.top();
                pq.pop();
                auto b = pq.top();
                pq.pop();
                int r = query(root(a.second),root(b.second));
                if (r==-2) return -1;
                if (r==-1){
                    mns.push_back(a.second);
                    mns.push_back(b.second);
                }
                else{
                    if (root(a.second)!=root(r)){
                        sz[root(r)] += sz[root(a.second)];
                        p[root(a.second)] = r;
                    }
                    if (root(b.second)!=root(r)){
                        sz[root(r)] += sz[root(b.second)];
                        p[root(b.second)] = r;
                    }
                    pq.push({sz[root(r)],r});
                }
            }
            continue;
        }
        auto a = pq.top();
        pq.pop();
        auto b = pq.top();
        pq.pop();
        auto c = pq.top();
        pq.pop();
        int res = query(root(a.second),root(b.second));
        if (res==-2) return -1;
        if (res==-1){
            int r2 = query(root(a.second),root(c.second));
            if (r2==-2) return -1;
            if (r2==-1) {
                int r3 = query(root(b.second),root(c.second));
                if (r3==-2) return -1;
                if (r3!=-1){
                    if (root(b.second)!=root(r3)){
                        sz[root(r3)] += sz[root(b.second)];
                        p[root(b.second)] = r3;
                    }
                    if (root(c.second)!=root(r3)){
                        sz[root(r3)] += sz[root(c.second)];
                        p[root(c.second)] = r3;
                    }
                    pq.push({sz[root(r3)],r3});
                }
                else{
                    if (pq.empty()){
                        mns.push_back(a.second);
                        mns.push_back(b.second);
                        mns.push_back(c.second);
                    }
                }
            }
            else{
                if (root(a.second)!=root(r2)){
                    sz[root(r2)] += sz[root(a.second)];
                    p[root(a.second)] = r2;
                }
                if (root(c.second)!=root(r2)){
                    sz[root(r2)] += sz[root(c.second)];
                    p[root(c.second)] = r2;
                }
                pq.push({sz[root(r2)],r2});
            }
        }
        else{
            if (root(b.second)!=root(res)){
                sz[root(res)] += sz[root(b.second)];
                p[root(b.second)] = res;
            }
            if (root(a.second)!=root(res)){
                sz[root(res)] += sz[root(a.second)];
                p[root(a.second)] = res;
            }
            pq.push({sz[root(res)],res});
        }
    }
    vector<pair<int,int> > mn2;
    for (int x = 0; x<N; x++){
        mn2.push_back({sz[root(x)],x});
    }
    sort(mn2.begin(),mn2.end(),greater<pair<int,int> >());
    for (auto mnx : mn2){
        int mn = mnx.second;
        for (int x = 0; x<N; x++){
            if (root(x)!=root(mn)&&queryCount<qLim){
                query(x,root(mn));
            }
        }
    }

    for (int x = 0; x<N; x++){
            for (int y = 0; y<N; y++){
                vis[y] = false;
            }
        if (dfs(x)>N/2){
            return x;
        }
    }


	return -1;
}

Compilation message

lokahia.cpp: In function 'int query(int, int)':
lokahia.cpp:25:47: warning: division by zero [-Wdiv-by-zero]
     if (a<0 || a>=NN || b<0 || b>=NN) return 1/0;
                                              ~^~
lokahia.cpp: In function 'int FindBase(int)':
lokahia.cpp:57:6: warning: unused variable 'mn' [-Wunused-variable]
  int mn = -1;
      ^~

Subtask #1
0 / 100.0

# Verdict Execution time Memory Grader output
1 Partially correct 6 ms 768 KB Partially correct : C = 400
2 Partially correct 5 ms 768 KB Partially correct : C = 400
3 Partially correct 5 ms 768 KB Partially correct : C = 400
4 Partially correct 6 ms 768 KB Partially correct : C = 400
5 Partially correct 5 ms 768 KB Partially correct : C = 400
6 Correct 5 ms 640 KB Correct : C = 12
7 Partially correct 5 ms 768 KB Partially correct : C = 400
8 Partially correct 5 ms 768 KB Partially correct : C = 400
9 Partially correct 5 ms 768 KB Partially correct : C = 400
10 Partially correct 5 ms 896 KB Partially correct : C = 400
11 Partially correct 5 ms 768 KB Partially correct : C = 400
12 Partially correct 5 ms 768 KB Partially correct : C = 400
13 Incorrect 7 ms 768 KB Wrong
14 Partially correct 5 ms 768 KB Partially correct : C = 400
15 Partially correct 6 ms 768 KB Partially correct : C = 400
16 Partially correct 5 ms 768 KB Partially correct : C = 400
17 Partially correct 6 ms 896 KB Partially correct : C = 400
18 Partially correct 5 ms 768 KB Partially correct : C = 400
19 Partially correct 6 ms 896 KB Partially correct : C = 400
20 Partially correct 5 ms 768 KB Partially correct : C = 400
21 Correct 4 ms 640 KB Correct : C = 0
22 Partially correct 6 ms 768 KB Partially correct : C = 400
23 Partially correct 5 ms 768 KB Partially correct : C = 400
24 Partially correct 6 ms 768 KB Partially correct : C = 400
25 Partially correct 6 ms 896 KB Partially correct : C = 400
26 Partially correct 5 ms 768 KB Partially correct : C = 400
27 Partially correct 6 ms 768 KB Partially correct : C = 400