Submission #39900

# Submission time Handle Problem Language Result Execution time Memory
39900 2018-01-23T15:49:13 Z mohammad_kilani Scales (IOI15_scales) C++14
45.4545 / 100
0 ms 2024 KB
#include "scales.h"
#include <bits/stdc++.h>
using namespace std;


void init(int T) {
   	
}

vector <int> get(int a,int b,int c){
	int cur1 = getLightest(a,b,c);
	int cur2 = getMedian(a,b,c);
	int cur3;
	if(a != cur1 && a != cur2) cur3 = a;
	if(b != cur1 && b != cur2) cur3 = b;
	if(c != cur1 && c != cur2) cur3 = c;
	vector<int> v;
	v.push_back(cur1);
	v.push_back(cur2);
	v.push_back(cur3);
	return v;
}

void orderCoins() {
    int val[7];
    vector< int > v[2];
    v[0] = get(1,2,3);
    v[1] = get(4,5,6);    
    int idx = 0;
    int idx1 = 0 , idx2 = 0;
    int w[6];
    while(idx < 3){
    	int a = getLightest(v[0][idx1],v[1][idx2],(idx1 == 2 ? v[1][idx2 + 1] : v[0][idx1 + 1]));
    	w[idx++] = a;
    	if(a == v[0][idx1])
    		idx1++;
    	else
    		idx2++;
    }
    vector<int> tmp;
    while(idx1 < v[0].size()) tmp.push_back(v[0][idx1++]);
    while(idx2 < v[1].size()) tmp.push_back(v[1][idx2++]);
    tmp = get(tmp[0],tmp[1],tmp[2]);
    for(int i=0;i<tmp.size();i++) w[idx++] = tmp[i];
    answer(w);

}

Compilation message

scales.cpp:6:15: warning: unused parameter 'T' [-Wunused-parameter]
 void init(int T) {
               ^
scales.cpp: In function 'void orderCoins()':
scales.cpp:41:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     while(idx1 < v[0].size()) tmp.push_back(v[0][idx1++]);
                ^
scales.cpp:42:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     while(idx2 < v[1].size()) tmp.push_back(v[1][idx2++]);
                ^
scales.cpp:44:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<tmp.size();i++) w[idx++] = tmp[i];
                  ^
scales.cpp:25:9: warning: unused variable 'val' [-Wunused-variable]
     int val[7];
         ^
# Verdict Execution time Memory Grader output
1 Partially correct 0 ms 2024 KB Output is partially correct
2 Partially correct 0 ms 2024 KB Output is partially correct
3 Partially correct 0 ms 2024 KB Output is partially correct
4 Partially correct 0 ms 2024 KB Output is partially correct
5 Partially correct 0 ms 2024 KB Output is partially correct
6 Partially correct 0 ms 2024 KB Output is partially correct
7 Partially correct 0 ms 2024 KB Output is partially correct
8 Partially correct 0 ms 2024 KB Output is partially correct
9 Partially correct 0 ms 2024 KB Output is partially correct
10 Partially correct 0 ms 2024 KB Output is partially correct
11 Partially correct 0 ms 2024 KB Output is partially correct
12 Partially correct 0 ms 2024 KB Output is partially correct
13 Partially correct 0 ms 2024 KB Output is partially correct
14 Partially correct 0 ms 2024 KB Output is partially correct
15 Partially correct 0 ms 2024 KB Output is partially correct
16 Partially correct 0 ms 2024 KB Output is partially correct
17 Partially correct 0 ms 2024 KB Output is partially correct
18 Partially correct 0 ms 2024 KB Output is partially correct
19 Partially correct 0 ms 2024 KB Output is partially correct
20 Partially correct 0 ms 2024 KB Output is partially correct
21 Partially correct 0 ms 2024 KB Output is partially correct
22 Partially correct 0 ms 2024 KB Output is partially correct
23 Partially correct 0 ms 2024 KB Output is partially correct
24 Partially correct 0 ms 2024 KB Output is partially correct
25 Partially correct 0 ms 2024 KB Output is partially correct
26 Partially correct 0 ms 2024 KB Output is partially correct
27 Partially correct 0 ms 2024 KB Output is partially correct
28 Partially correct 0 ms 2024 KB Output is partially correct
29 Partially correct 0 ms 2024 KB Output is partially correct
30 Partially correct 0 ms 2024 KB Output is partially correct
31 Partially correct 0 ms 2024 KB Output is partially correct
32 Partially correct 0 ms 2024 KB Output is partially correct
33 Partially correct 0 ms 2024 KB Output is partially correct
34 Partially correct 0 ms 2024 KB Output is partially correct
35 Partially correct 0 ms 2024 KB Output is partially correct
36 Partially correct 0 ms 2024 KB Output is partially correct
37 Partially correct 0 ms 2024 KB Output is partially correct
38 Partially correct 0 ms 2024 KB Output is partially correct
39 Partially correct 0 ms 2024 KB Output is partially correct
40 Partially correct 0 ms 2024 KB Output is partially correct