oj.uz

Submission #140101

# Submission time Handle Problem Language Result Execution time Memory
140101 2019-08-02T05:01:41 Z SirCeness Scales (IOI15_scales) C++14
55.5556 / 100
 2 ms 380 KB 
#include "scales.h"
#include <bits/stdc++.h>

#define pb push_back
#define mp make_pair
#define inside sl<=l&&r<=sr
#define outside r<sl||sr<l
#define orta ((l+r)>>1)
#define INF 1000000009
#define mod 1000000007
#define ppair(x); cerr << "(" << x.first << ", " << x.second << ")\n";
#define bas(x) #x << ": " << x << " "
#define prarr(x, n); cerr << #x << ": "; for(int qsd = 0; qsd < n; qsd++) cerr << x[qsd] << " "; cerr << "\n";
#define prarrv(x); cerr << #x << ": "; for(int qsd = 0; qsd < (int)x.size(); qsd++) cerr << x[qsd] << " "; cerr << "\n";
using namespace std;
typedef long long ll;

void init(int T) {
    
}

void sil(vector<int>& arr, int val){
	for (int i = 0; i < arr.size()-1; i++){
		if (arr[i] == val){
			swap(arr[i], arr[arr.size()-1]);
			break;
		}
	}
	arr.pop_back();
}

void swap(int a, int b, vector<int>& ar){
	if (a == b) return;
	int s1, s2;
	for (int i = 0; i < ar.size(); i++){
		if (ar[i] == a) s1 = i;
		if (ar[i] == b) s2 = i;
	}
	swap(ar[s1], ar[s2]);
}

void orderCoins() {
    /* ... */
    int W[] = {1, 2, 3, 4, 5, 6};
	vector<int> arr;
	for (int i = 0; i < 6; i++) arr.pb(i+1);
	int l1 = getLightest(arr[0], arr[1], arr[2]);
	swap(l1, arr[0], arr);
	//prarrv(arr);
	int l2 = getLightest(arr[3], arr[4], arr[5]);
	swap(l2, arr[3], arr);
	swap(arr[1], arr[3], arr);
	//prarrv(arr);
	int minn = getLightest(arr[0], arr[1], arr[2]);
	if (minn == arr[1]){
		swap(arr[0], arr[1], arr);
		swap(arr[2], arr[4], arr);
		swap(arr[3], arr[5], arr);
	}
	//prarrv(arr);
	
	int minn2 = getLightest(arr[1], arr[2], arr[3]);
	swap(minn2, arr[1], arr);
	//prarrv(arr);
	
	int olmaz = getHeaviest(arr[2], arr[3], arr[4]);
	swap(olmaz, arr[5], arr);
	int sonmin = getLightest(arr[2], arr[3], arr[4]);
	swap(sonmin, arr[2], arr);
	//prarrv(arr);
	
	
	int minnn = getLightest(arr[3], arr[4], arr[5]);
	swap(arr[3], minnn, arr);
	int maxxx = getHeaviest(arr[3], arr[4], arr[5]);
	swap(arr[5], maxxx, arr);
	for (int i = 0; i < 6; i++) W[i] = arr[i];
    answer(W);
}

Compilation message

scales.cpp: In function 'void init(int)':
scales.cpp:18:15: warning: unused parameter 'T' [-Wunused-parameter]
 void init(int T) {
               ^
scales.cpp: In function 'void sil(std::vector<int>&, int)':
scales.cpp:23:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < arr.size()-1; i++){
                  ~~^~~~~~~~~~~~~~
scales.cpp: In function 'void swap(int, int, std::vector<int>&)':
scales.cpp:35:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < ar.size(); i++){
                  ~~^~~~~~~~~~~
scales.cpp:39:20: warning: 's2' may be used uninitialized in this function [-Wmaybe-uninitialized]
  swap(ar[s1], ar[s2]);
                    ^
scales.cpp:39:12: warning: 's1' may be used uninitialized in this function [-Wmaybe-uninitialized]
  swap(ar[s1], ar[s2]);
            ^

Subtask #1
55.555556 / 100.0

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