oj.uz

Submission #961406

# Submission time Handle Problem Language Result Execution time Memory
961406 2024-04-12T03:57:50 Z 12345678 Scales (IOI15_scales) C++17
45.4545 / 100
 1 ms 440 KB 
#include "scales.h"
#include <bits/stdc++.h>

using namespace std;

void init(int T) {
    return;
}

int res[6], mn;
vector<int> v;

void getmin()
{
    vector<int> v2;
    if (v.size()==3) 
    {
        res[3]=getLightest(v[0], v[1], v[2]);
        for (int i=0; i<v.size(); i++) if (v[i]!=res[3]) v2.push_back(v[i]);
        v=v2;
    }
    else if (v.size()==2)
    {
        res[4]=getMedian(v[0], v[1], res[0]);
        for (int i=0; i<v.size(); i++) if (v[i]!=res[4]) v2.push_back(v[i]);
        v=v2;
    }
    else if (v.size()==1)
    {
        res[5]=v[0];
    }
    else if (v.size()==6)
    {
        mn=getLightest(v[0], v[1], v[2]);
        mn=getLightest(mn, v[3], v[4]);
        mn=getLightest(mn, v[5], v[0+(mn==1)]);
        res[0]=mn;
        for (int i=0; i<v.size(); i++) if (v[i]!=mn) v2.push_back(v[i]);
        v=v2;
    }
    else if (v.size()==5)
    {
        mn=getLightest(v[0], v[1], v[2]);
        mn=getLightest(mn, v[3], v[4]);
        res[1]=mn;
        for (int i=0; i<v.size(); i++) if (v[i]!=mn) v2.push_back(v[i]);
        v=v2;
    }
    else if (v.size()==4)
    {
        mn=getLightest(v[0], v[1], v[2]);
        mn=getLightest(mn, v[3], v[0+(mn==v[0])]);
        res[2]=mn;
        for (int i=0; i<v.size(); i++) if (v[i]!=mn) v2.push_back(v[i]);
        v=v2;
    }
}

void orderCoins() {
    v.clear();
    for (int i=1; i<=6; i++) v.push_back(i);
    for (int i=0; i<6; i++) getmin();
    answer(res);
}

Compilation message

scales.cpp: In function 'void init(int)':
scales.cpp:6:15: warning: unused parameter 'T' [-Wunused-parameter]
    6 | void init(int T) {
      |           ~~~~^
scales.cpp: In function 'void getmin()':
scales.cpp:19:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   19 |         for (int i=0; i<v.size(); i++) if (v[i]!=res[3]) v2.push_back(v[i]);
      |                       ~^~~~~~~~~
scales.cpp:25:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   25 |         for (int i=0; i<v.size(); i++) if (v[i]!=res[4]) v2.push_back(v[i]);
      |                       ~^~~~~~~~~
scales.cpp:38:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   38 |         for (int i=0; i<v.size(); i++) if (v[i]!=mn) v2.push_back(v[i]);
      |                       ~^~~~~~~~~
scales.cpp:46:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   46 |         for (int i=0; i<v.size(); i++) if (v[i]!=mn) v2.push_back(v[i]);
      |                       ~^~~~~~~~~
scales.cpp:54:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   54 |         for (int i=0; i<v.size(); i++) if (v[i]!=mn) v2.push_back(v[i]);
      |                       ~^~~~~~~~~

Subtask #1
45.454545 / 100.0

# Verdict Execution time Memory Grader output
1 Partially correct 0 ms 348 KB Output is partially correct
2 Partially correct 0 ms 348 KB Output is partially correct
3 Partially correct 0 ms 348 KB Output is partially correct
4 Partially correct 0 ms 432 KB Output is partially correct
5 Partially correct 0 ms 344 KB Output is partially correct
6 Partially correct 1 ms 348 KB Output is partially correct
7 Partially correct 0 ms 348 KB Output is partially correct
8 Partially correct 1 ms 348 KB Output is partially correct
9 Partially correct 1 ms 344 KB Output is partially correct
10 Partially correct 0 ms 348 KB Output is partially correct
11 Partially correct 0 ms 348 KB Output is partially correct
12 Partially correct 1 ms 348 KB Output is partially correct
13 Partially correct 1 ms 348 KB Output is partially correct
14 Partially correct 0 ms 348 KB Output is partially correct
15 Partially correct 1 ms 348 KB Output is partially correct
16 Partially correct 0 ms 348 KB Output is partially correct
17 Partially correct 0 ms 348 KB Output is partially correct
18 Partially correct 0 ms 348 KB Output is partially correct
19 Partially correct 0 ms 348 KB Output is partially correct
20 Partially correct 0 ms 344 KB Output is partially correct
21 Partially correct 1 ms 348 KB Output is partially correct
22 Partially correct 1 ms 348 KB Output is partially correct
23 Partially correct 1 ms 348 KB Output is partially correct
24 Partially correct 0 ms 344 KB Output is partially correct
25 Partially correct 1 ms 348 KB Output is partially correct
26 Partially correct 0 ms 348 KB Output is partially correct
27 Partially correct 0 ms 348 KB Output is partially correct
28 Partially correct 0 ms 344 KB Output is partially correct
29 Partially correct 0 ms 348 KB Output is partially correct
30 Partially correct 1 ms 344 KB Output is partially correct
31 Partially correct 0 ms 348 KB Output is partially correct
32 Partially correct 0 ms 348 KB Output is partially correct
33 Partially correct 0 ms 348 KB Output is partially correct
34 Partially correct 1 ms 344 KB Output is partially correct
35 Partially correct 0 ms 348 KB Output is partially correct
36 Partially correct 0 ms 348 KB Output is partially correct
37 Partially correct 1 ms 348 KB Output is partially correct
38 Partially correct 1 ms 344 KB Output is partially correct
39 Partially correct 0 ms 440 KB Output is partially correct
40 Partially correct 0 ms 348 KB Output is partially correct