oj.uz

Submission #827512

# Submission time Handle Problem Language Result Execution time Memory
827512 2023-08-16T14:13:33 Z Supersonic Scales (IOI15_scales) C++14
46.8182 / 100
 87 ms 332 KB 
#include "scales.h"
#include <bits/stdc++.h>
using namespace std;
set<int> gt[7];
set<int> lt[7];
set<int> gtbk[7];
set<int> ltbk[7];
int score(){
    int sc=0;
    for(int i=1;i<=6;i++){
        sc+=(int)(gt[i].size()+lt[i].size());
    }
    //cerr<<sc<<endl;
    return sc;
}
void backup(){
    for(int i=1;i<=6;i++){
        gtbk[i]=gt[i];
        ltbk[i]=lt[i];
    }
}
void restore(){
    for(int i=1;i<=6;i++){
        gt[i]=gtbk[i];
        lt[i]=ltbk[i];
    }
}
void clean(){
    for(int i=1;i<=6;i++){
        gt[i].clear();
        lt[i].clear();
    }
    backup();
}

void dbg(){
    for(int i=1;i<=6;i++){
        cerr<<i<<" is greater than ";for(auto j:gt[i])cerr<<j<<' ';cerr<<endl;
    }cerr<<endl;

    for(int i=1;i<=6;i++){
        cerr<<i<<" is less than ";for(auto j:lt[i])cerr<<j<<' ';cerr<<endl;
    }cerr<<endl;
}

vector<int> done(){
    //dbg();
    vector<pair<int,int>> ix;
    bool chk[6]={0,0,0,0,0,0};
    for(int i=1;i<=6;i++){
        ix.push_back({lt[i].size(),i});
        chk[lt[i].size()]=1;
    }
    if(!(chk[0]&&chk[1]&&chk[2]&&chk[3]&&chk[4]&&chk[5]))return {-1};
    sort(ix.rbegin(),ix.rend());
    vector<int> r;
    for(auto i:ix)r.push_back(i.second);
    return r;
}

void update(int a,int b){
    if(a==b)return;
    //cerr<<a<<' '<<b<<endl;
    gt[b].insert(a);
    lt[a].insert(b);
    for(auto i:gt[a]){gt[b].insert(i);lt[i].insert(b);}
    for(auto i:lt[b]){lt[a].insert(i);gt[i].insert(a);}

    //for(int i=1;i<=6;i++)cerr<<gt[i].size()<<' ';cerr<<endl;
}
void init(int T) {
    T++;
}

void orderCoins() {
    clean();
    while(true){
        // lightest = 1, heaviest = 2
        vector<int> bop;int bopt=-1;int bc=-1;
        
        // lightest
        for(int a=1;a<=6;a++)for(int b=1;b<=6;b++)for(int c=1;c<=6;c++){
            if(a==b||a==c||b==c)continue;
            int e=1000000;
            backup();update(a,b);update(a,c);e=min(e,score());restore();
            backup();update(b,a);update(b,c);e=min(e,score());restore();
            backup();update(c,a);update(c,b);e=min(e,score());restore();
            if(e>bc){bc=e;bopt=1;bop={a,b,c};}
        }

        for(int a=1;a<=6;a++)for(int b=1;b<=6;b++)for(int c=1;c<=6;c++){
            if(a==b||a==c||b==c)continue;
            int e=1000000;
            backup();update(b,a);update(c,a);e=min(e,score());restore();
            backup();update(a,b);update(c,b);e=min(e,score());restore();
            backup();update(a,c);update(b,c);e=min(e,score());restore();
            if(e>bc){bc=e;bopt=2;bop={a,b,c};}
        }
        for(int a=1;a<=6;a++)for(int b=1;b<=6;b++)for(int c=1;c<=6;c++){
            if(a==b||a==c||b==c)continue;
            int e=1000000;
            backup();
            if(gt[a].count(b)){update(a,c);}
            else if(gt[a].count(c)){update(a,b);}
            e=min(e,score());restore();
            backup();
            if(gt[b].count(a)){update(b,c);}
            else if(gt[b].count(c)){update(b,a);}
            e=min(e,score());restore();
            backup();
            if(gt[c].count(a)){update(c,b);}
            else if(gt[c].count(b)){update(c,a);}
            e=min(e,score());restore();
            if(e>bc){bc=e;bopt=3;bop={a,b,c};}
        }
        if(bopt==-1){cerr<<"ERROR"<<endl;exit(1);}
        if(bopt==1){
            //cerr<<"LIGHT: "<<bop[0]<<' '<<bop[1]<<' '<<bop[2]<<endl;
            //cerr<<bc<<endl;
            int r=getLightest(bop[0],bop[1],bop[2]);
            update(r,bop[0]);update(r,bop[1]);update(r,bop[2]);
        }
        if(bopt==2){
            //cerr<<"HEAVY: "<<bop[0]<<' '<<bop[1]<<' '<<bop[2]<<endl;
            //cerr<<bc<<endl;
            int r=getHeaviest(bop[0],bop[1],bop[2]);
            update(bop[0],r);update(bop[1],r);update(bop[2],r);
        }
        if(bopt==3){
            int r=getMedian(bop[0],bop[1],bop[2]);
            if(r==bop[0]){
                if(gt[bop[0]].count(bop[1])){update(bop[0],bop[2]);}
                else if(gt[bop[0]].count(bop[2])){update(bop[0],bop[1]);}
            }
            if(r==bop[1]){
                if(gt[bop[1]].count(bop[0])){update(bop[1],bop[2]);}
                else if(gt[bop[1]].count(bop[2])){update(bop[1],bop[0]);}
            }
            if(r==bop[2]){
                if(gt[bop[2]].count(bop[0])){update(bop[2],bop[1]);}
                else if(gt[bop[2]].count(bop[1])){update(bop[2],bop[0]);}
            }
        }
        vector<int> rr=done();
        if(rr[0]>0){
            int ra[6]={rr[0],rr[1],rr[2],rr[3],rr[4],rr[5]};
            answer(ra);
            return;
        }
        //else clean();
    }
    
}

Subtask #1
46.818182 / 100.0

# Verdict Execution time Memory Grader output
1 Partially correct 80 ms 212 KB Output is partially correct
2 Partially correct 82 ms 280 KB Output is partially correct
3 Partially correct 77 ms 284 KB Output is partially correct
4 Partially correct 78 ms 284 KB Output is partially correct
5 Partially correct 82 ms 292 KB Output is partially correct
6 Partially correct 80 ms 212 KB Output is partially correct
7 Partially correct 84 ms 212 KB Output is partially correct
8 Partially correct 81 ms 280 KB Output is partially correct
9 Partially correct 82 ms 280 KB Output is partially correct
10 Partially correct 80 ms 212 KB Output is partially correct
11 Partially correct 77 ms 212 KB Output is partially correct
12 Partially correct 87 ms 284 KB Output is partially correct
13 Partially correct 80 ms 296 KB Output is partially correct
14 Partially correct 83 ms 212 KB Output is partially correct
15 Partially correct 78 ms 212 KB Output is partially correct
16 Partially correct 86 ms 332 KB Output is partially correct
17 Partially correct 79 ms 212 KB Output is partially correct
18 Partially correct 79 ms 284 KB Output is partially correct
19 Partially correct 79 ms 284 KB Output is partially correct
20 Partially correct 77 ms 212 KB Output is partially correct
21 Partially correct 81 ms 284 KB Output is partially correct
22 Partially correct 84 ms 280 KB Output is partially correct
23 Partially correct 81 ms 284 KB Output is partially correct
24 Partially correct 80 ms 212 KB Output is partially correct
25 Partially correct 80 ms 212 KB Output is partially correct
26 Partially correct 79 ms 280 KB Output is partially correct
27 Partially correct 77 ms 288 KB Output is partially correct
28 Partially correct 79 ms 284 KB Output is partially correct
29 Partially correct 85 ms 284 KB Output is partially correct
30 Partially correct 81 ms 276 KB Output is partially correct
31 Partially correct 78 ms 280 KB Output is partially correct
32 Partially correct 78 ms 212 KB Output is partially correct
33 Partially correct 78 ms 296 KB Output is partially correct
34 Partially correct 78 ms 284 KB Output is partially correct
35 Partially correct 80 ms 212 KB Output is partially correct
36 Partially correct 79 ms 280 KB Output is partially correct
37 Partially correct 79 ms 288 KB Output is partially correct
38 Partially correct 81 ms 212 KB Output is partially correct
39 Partially correct 82 ms 288 KB Output is partially correct
40 Partially correct 83 ms 212 KB Output is partially correct