oj.uz

Submission #410097

# Submission time Handle Problem Language Result Execution time Memory
410097 2021-05-22T01:31:02 Z definitelynotmee Towns (IOI15_towns) C++
100 / 100
 23 ms 856 KB 
// Que problema lindo. Muito foda jeito e o motivo que tudo só se encaixa na solução pra 100 pontos
#include <bits/stdc++.h>
#include "towns.h"
#define mp make_pair
#define mt make_tuple
#define ff first
#define ss second
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
const ll INFL = (1LL<<62)-1;
const int INF = (1<<30)-1;
const int MAXN = 0;

int getDistance(int i, int j);

inline bool check(int i, int j, vector<bool>& v, vector<int>& db, int lb, int a){

    if(i==j)
        return 1;
    if(v[i]^v[j])
        return 0;
    if(v[i])
        return 1;
    
    int L = (db[i] + db[j] - getDistance(i,j))>>1;
    return min(L,db[a]-L) != lb;
}

int hubDistance(int n, int sub){
    int a = 0, b;
    vector<int> ds (n,0), db(n,0);

    int maxi = -1;
    for(int i = 1; i < n; i++){
        ds[i] = getDistance(0,i);
        if(ds[i] > maxi)
            maxi = ds[i], b = i;
    }
    maxi = ds[b];
    db[0] = ds[b];
    for(int i = 1; i < n; i++){
        if(i==b)
            continue;
        db[i] = getDistance(b,i);
        if(db[i] > maxi)
            maxi = db[i], a = i;
    }
    vector<int> dlca(n,0); // dist(lca(x,0) na arvore enraizada no b, b)
    vector<bool> bsub(n,0); // verdadeiro se x está na subarvore do b
    int resp = INF;
    for(int i = 0; i < n; i++){
        dlca[i] = (db[0] + db[i] - ds[i])>>1;
        resp = min(resp, max(dlca[i], db[a] - dlca[i]));
    }
    int lb = min(resp, db[a]-resp);
    for(int i = 0; i < n; i++){
        if(dlca[i] < lb)
            bsub[i] = 1;
    }

    // ao parear os indices e considerar apenas aqueles que estão no mesmo grupo,
    // caso haja um majoritário ele será majoritário tanto no vetor inicial quanto no modificado

    stack<int,vector<int>> st;
    vector<bool> par(n,0); // verdadeiro se x estiver pareado
    for(int i = 0; i < (n>>1); i++){
        int cur = 2*i;
        //cout << "check(" << cur << "," << cur+1 << ") = " << check(cur,cur+1,bsub,db, lb,a) << '\n';
        if(!check(cur,cur+1,bsub,db, lb,a))
            continue;
        par[cur] = 1;
        par[cur+1] = 1;
        if(st.empty()){
            st.push(cur);
        } else {
            //cout << "check(" << st.top() << "," << cur << ") = " << check(st.top(), cur, bsub,db,lb,a) << '\n';
            if(check(st.top(), cur, bsub,db,lb,a))
                st.push(cur);
            else st.pop();
        }
    }
    int major = (st.empty() ? n-1 : st.top());
    //cout << "pares ->";
    //for(bool i : par)
    //    cout << i;
    //cout << '\n';
    int majorcount = 0;
    for(int i = 0; i < n; i++){
        if(par[i]){
            if(i&1)
                continue;
            //cout << "check(" << i << "," << major << ") = " << check(i,major,bsub,db,lb,a) << '\n';
            if(check(i,major,bsub,db,lb,a))
                majorcount+=2;
        } else {
            //cout << "check(" << i << "," << major << ") = " << check(i,major,bsub,db,lb,a) << '\n';
            if(check(i,major,bsub,db,lb,a))
                majorcount++;
        }
        
    }
    //cout << major << ' ' << majorcount << "\n";
    if(majorcount > (n>>1))
        resp*=-1;
    return resp;
}

Compilation message

towns.cpp: In function 'int hubDistance(int, int)':
towns.cpp:31:28: warning: unused parameter 'sub' [-Wunused-parameter]
   31 | int hubDistance(int n, int sub){
      |                        ~~~~^~~
towns.cpp:41:16: warning: 'b' may be used uninitialized in this function [-Wmaybe-uninitialized]
   41 |     maxi = ds[b];
      |                ^

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 344 KB Output is correct
2 Correct 16 ms 332 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 18 ms 336 KB Output is correct
5 Correct 18 ms 340 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 344 KB Output is correct
2 Correct 14 ms 348 KB Output is correct
3 Correct 18 ms 336 KB Output is correct
4 Correct 19 ms 332 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 332 KB Output is correct
2 Correct 18 ms 332 KB Output is correct
3 Correct 1 ms 296 KB Output is correct
4 Correct 18 ms 828 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 340 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 344 KB Output is correct
2 Correct 18 ms 332 KB Output is correct
3 Correct 22 ms 856 KB Output is correct

Subtask #6
39.0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 348 KB Output is correct
2 Correct 18 ms 332 KB Output is correct
3 Correct 23 ms 856 KB Output is correct