oj.uz

답안 #619479

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
619479 2022-08-02T12:23:38 Z BERNARB01 저울 (IOI15_scales) C++17
45.4545 / 100
 1 ms 212 KB 
#include <bits/stdc++.h>
#include "scales.h"

using namespace std;

#ifdef B01
#include "../debb.h"
#else
#define deb(...)
#endif

const int n = 6;

void init(int T) {
}

inline int getO(int i) {
  return (i + 1) % 3;
}

inline int getOO(int i) {
  return (i + 2) % 3;
}

void orderCoins() {
  int mnl = getLightest(1, 2, 3);
  int mnr = getLightest(4, 5, 6);
  int mxl = getHeaviest(1, 2, 3);
  int mxr = getHeaviest(4, 5, 6);
  int mn = getLightest(mnl, mnr, getO(mnl - 1) + 1);
  int mx = getHeaviest(mxl, mxr, getO(mxl - 1) + 1);
  int mn2 = (mn == mnl ? getLightest(mnr, getO(mnl - 1) + 1, getOO(mnl - 1) + 1) : getLightest(mnl, getO(mnr - 4) + 4, getOO(mnr - 4) + 4));
  int mx2 = (mx == mxl ? getHeaviest(mxr, getO(mxl - 1) + 1, getOO(mxl - 1) + 1) : getHeaviest(mxl, getO(mxr - 4) + 4, getOO(mxr - 4) + 4));
  set<int> se = {1, 2, 3, 4, 5, 6};
  se.erase(mn);
  se.erase(mn2);
  se.erase(mx2);
  vector<int> z(se.begin(), se.end());
  int l = getLightest(z[0], z[1], z[2]);
  se.erase(mx);
  se.erase(l);
  vector<int> w = {mn, mn2, l, *se.begin(), mx2, mx};
  answer(w.data());
}

Compilation message

scales.cpp: In function 'void init(int)':
scales.cpp:14:15: warning: unused parameter 'T' [-Wunused-parameter]
   14 | void init(int T) {
      |           ~~~~^

Subtask #1
45.454545 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 0 ms 212 KB Output is partially correct
2 Partially correct 1 ms 212 KB Output is partially correct
3 Partially correct 0 ms 212 KB Output is partially correct
4 Partially correct 0 ms 212 KB Output is partially correct
5 Partially correct 0 ms 212 KB Output is partially correct
6 Partially correct 0 ms 212 KB Output is partially correct
7 Partially correct 0 ms 212 KB Output is partially correct
8 Partially correct 0 ms 212 KB Output is partially correct
9 Partially correct 0 ms 212 KB Output is partially correct
10 Partially correct 0 ms 212 KB Output is partially correct
11 Partially correct 0 ms 212 KB Output is partially correct
12 Partially correct 0 ms 212 KB Output is partially correct
13 Partially correct 0 ms 212 KB Output is partially correct
14 Partially correct 0 ms 212 KB Output is partially correct
15 Partially correct 0 ms 212 KB Output is partially correct
16 Partially correct 1 ms 212 KB Output is partially correct
17 Partially correct 0 ms 212 KB Output is partially correct
18 Partially correct 0 ms 212 KB Output is partially correct
19 Partially correct 0 ms 212 KB Output is partially correct
20 Partially correct 0 ms 212 KB Output is partially correct
21 Partially correct 1 ms 212 KB Output is partially correct
22 Partially correct 1 ms 212 KB Output is partially correct
23 Partially correct 1 ms 212 KB Output is partially correct
24 Partially correct 1 ms 212 KB Output is partially correct
25 Partially correct 1 ms 212 KB Output is partially correct
26 Partially correct 0 ms 212 KB Output is partially correct
27 Partially correct 0 ms 212 KB Output is partially correct
28 Partially correct 1 ms 212 KB Output is partially correct
29 Partially correct 1 ms 212 KB Output is partially correct
30 Partially correct 0 ms 212 KB Output is partially correct
31 Partially correct 1 ms 212 KB Output is partially correct
32 Partially correct 0 ms 212 KB Output is partially correct
33 Partially correct 1 ms 212 KB Output is partially correct
34 Partially correct 1 ms 212 KB Output is partially correct
35 Partially correct 1 ms 212 KB Output is partially correct
36 Partially correct 1 ms 212 KB Output is partially correct
37 Partially correct 1 ms 212 KB Output is partially correct
38 Partially correct 0 ms 212 KB Output is partially correct
39 Partially correct 1 ms 212 KB Output is partially correct
40 Partially correct 0 ms 212 KB Output is partially correct