oj.uz

Submission #922413

# Submission time Handle Problem Language Result Execution time Memory
922413 2024-02-05T13:36:44 Z coding_snorlax Scales (IOI15_scales) C++14
71.4286 / 100
 163 ms 604 KB 
#include<bits/stdc++.h>
#include "scales.h"
using namespace std;
vector<vector<int>> All_possible,tmp;
void init(int T){}
void init1(){
    All_possible.clear();
    for(int a1=1;a1<=6;a1++){
        for(int a2=1;a2<=6;a2++){
            for(int a3=1;a3<=6;a3++){
                for(int a4=1;a4<=6;a4++){
                    for(int a5=1;a5<=6;a5++){
                        for(int a6=1;a6<=6;a6++){
                            set<int> ct = {a1,a2,a3,a4,a5,a6};
                            if(ct.size()==6) All_possible.push_back({0,a1,a2,a3,a4,a5,a6});
                        }
                    }
                }
            }
        }
    }
}
int mock_A(int a,int b,int c){
    set<int> ct = {a,b,c};
    if((int)ct.size()!=3) return 10000;
    int tmp1 = 0,tmp2 = 0, tmp3 = 0;
    for(auto List:All_possible){
        if(List[a]>List[b] && List[a]>List[c]) tmp1++;
        else if (List[b]>List[a] && List[b]>List[c]) tmp2++;
        else tmp3++;
    }
    return max(tmp1,max(tmp2,tmp3));
}
int mock_B(int a,int b,int c){
    set<int> ct = {a,b,c};
    if((int)ct.size()!=3) return 10000;
    int tmp1 = 0,tmp2 = 0, tmp3 = 0;
    for(auto List:All_possible){
        //cout << List[0] << " ";
        if(List[a]<List[b] && List[a]<List[c]) tmp1++;
        else if (List[b]<List[a] && List[b]<List[c]) tmp2++;
        else tmp3++;
    }
    return max(tmp1,max(tmp2,tmp3));
}
int mock_C(int a,int b,int c){
    set<int> ct = {a,b,c};
    if((int)ct.size()!=3) return 10000;
    int tmp1 = 0,tmp2 = 0, tmp3 = 0;
    for(auto List:All_possible){
        if(max(List[b],List[c])>List[a] && List[a]>min(List[b],List[c])) tmp1++;
        else if(max(List[a],List[c])>List[b] && List[b]>min(List[a],List[c])) tmp2++;
        else tmp3++;
    }
    return max(tmp1,max(tmp2,tmp3));
}
int Check_A(int a,int b,int c, vector<int> List,int res){
    if(List[a]>List[b] && List[a]>List[c] && res==a) return 1;
    else if (List[b]>List[a] && List[b]>List[c] && res==b) return 1;
    else if (List[c]>List[a] && List[c]>List[b] && res==c) return 1;
    return 0;
}

int Check_B(int a,int b,int c, vector<int> List,int res){
    if(List[a]<List[b] && List[a]<List[c] && res==a) return 1;
    else if (List[b]<List[a] && List[b]<List[c] && res==b) return 1;
    else if (List[c]<List[a] && List[c]<List[b] && res==c) return 1;
    return 0;
}

int Check_C(int a,int b,int c, vector<int> List,int res){
    if(max(List[b],List[c])>List[a] && List[a]>min(List[b],List[c]) && res==a) return 1;
    else if(max(List[a],List[c])>List[b] && List[b]>min(List[a],List[c]) && res==b) return 1;
    else if(max(List[a],List[b])>List[c] && List[c]>min(List[a],List[b]) && res==c) return 1;
    return 0;
}
void orderCoins(){
    init1();
    while(All_possible.size()>1){
        int Q_index,tmp1,tmp2,tmp3,Total=720;
        for(int i=1;i<=6;i++){
            for(int j=i+1;j<=6;j++){
                for(int k=j+1;k<=6;k++){
                    int tmp4 = mock_A(i,j,k);
                    if(tmp4<Total){
                        Total = tmp4;tmp1 = i;tmp2 = j;tmp3 = k;Q_index=1;
                    }
                    tmp4 = mock_B(i,j,k);
                    if(tmp4<Total){
                        Total = tmp4;tmp1 = i;tmp2 = j;tmp3 = k;Q_index=2;
                    }
                    tmp4 = mock_C(i,j,k);
                    if(tmp4<Total){
                        Total = tmp4;tmp1 = i;tmp2 = j;tmp3 = k;Q_index=3;
                    }
                }
            }
        }
        tmp.clear();
        int res;
        if(Q_index==1){
            res = getHeaviest(tmp1,tmp2,tmp3);
            for(auto i:All_possible){
                if(Check_A(tmp1,tmp2,tmp3,i,res)) tmp.push_back(i);
            }
        }
        else if(Q_index==2){
            res = getLightest(tmp1,tmp2,tmp3);
            for(auto i:All_possible){
                if(Check_B(tmp1,tmp2,tmp3,i,res)) tmp.push_back(i);
            }
        }
        else if(Q_index==3){
            res = getMedian(tmp1,tmp2,tmp3);
            for(auto i:All_possible){
                if(Check_C(tmp1,tmp2,tmp3,i,res)) tmp.push_back(i);
            }
        }
        All_possible = tmp;
    }
    int Answer[6];
    for(int i=1;i<=6;i++){
        Answer[All_possible[0][i]-1]=i;
    }
    answer(Answer);
}

Compilation message

scales.cpp: In function 'void init(int)':
scales.cpp:5:15: warning: unused parameter 'T' [-Wunused-parameter]
    5 | void init(int T){}
      |           ~~~~^
scales.cpp: In function 'void orderCoins()':
scales.cpp:104:27: warning: 'tmp3' may be used uninitialized in this function [-Wmaybe-uninitialized]
  104 |                 if(Check_A(tmp1,tmp2,tmp3,i,res)) tmp.push_back(i);
      |                    ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
scales.cpp:104:27: warning: 'tmp2' may be used uninitialized in this function [-Wmaybe-uninitialized]
scales.cpp:104:27: warning: 'tmp1' may be used uninitialized in this function [-Wmaybe-uninitialized]
scales.cpp:107:14: warning: 'Q_index' may be used uninitialized in this function [-Wmaybe-uninitialized]
  107 |         else if(Q_index==2){
      |              ^~

Subtask #1
71.428571 / 100.0

# Verdict Execution time Memory Grader output
1 Partially correct 144 ms 492 KB Output is partially correct
2 Partially correct 160 ms 488 KB Output is partially correct
3 Partially correct 163 ms 348 KB Output is partially correct
4 Partially correct 144 ms 488 KB Output is partially correct
5 Partially correct 144 ms 492 KB Output is partially correct
6 Partially correct 144 ms 488 KB Output is partially correct
7 Partially correct 144 ms 488 KB Output is partially correct
8 Partially correct 143 ms 476 KB Output is partially correct
9 Partially correct 145 ms 488 KB Output is partially correct
10 Partially correct 147 ms 592 KB Output is partially correct
11 Partially correct 144 ms 484 KB Output is partially correct
12 Partially correct 144 ms 488 KB Output is partially correct
13 Partially correct 144 ms 348 KB Output is partially correct
14 Partially correct 150 ms 604 KB Output is partially correct
15 Partially correct 145 ms 488 KB Output is partially correct
16 Partially correct 145 ms 344 KB Output is partially correct
17 Partially correct 145 ms 492 KB Output is partially correct
18 Partially correct 144 ms 348 KB Output is partially correct
19 Partially correct 144 ms 488 KB Output is partially correct
20 Partially correct 145 ms 344 KB Output is partially correct
21 Partially correct 145 ms 544 KB Output is partially correct
22 Partially correct 159 ms 348 KB Output is partially correct
23 Partially correct 143 ms 488 KB Output is partially correct
24 Partially correct 148 ms 484 KB Output is partially correct
25 Partially correct 144 ms 432 KB Output is partially correct
26 Partially correct 145 ms 484 KB Output is partially correct
27 Partially correct 144 ms 492 KB Output is partially correct
28 Partially correct 145 ms 356 KB Output is partially correct
29 Partially correct 144 ms 344 KB Output is partially correct
30 Partially correct 144 ms 496 KB Output is partially correct
31 Partially correct 148 ms 344 KB Output is partially correct
32 Partially correct 144 ms 484 KB Output is partially correct
33 Partially correct 144 ms 348 KB Output is partially correct
34 Partially correct 144 ms 348 KB Output is partially correct
35 Partially correct 145 ms 600 KB Output is partially correct
36 Partially correct 145 ms 484 KB Output is partially correct
37 Partially correct 144 ms 344 KB Output is partially correct
38 Partially correct 147 ms 348 KB Output is partially correct
39 Partially correct 145 ms 488 KB Output is partially correct
40 Partially correct 144 ms 488 KB Output is partially correct