oj.uz

답안 #888290

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
888290 2023-12-16T21:06:00 Z hamidh100 코알라 (APIO17_koala) C++17
19 / 100
 32 ms 600 KB 
#include "koala.h"
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
typedef vector<int> VI;
typedef vector<ll> VL;
#define PB push_back
#define MP make_pair
#define all(a) (a).begin(), (a).end()
#define endl '\n'
#define dbg(x) cerr << '[' << #x << ": " << x << "]\n"
#define dbg2(x, y) cerr << '[' << #x << ": " << x << ", " << #y << ": " << y << "]\n"
#define YES cout << "YES\n"
#define NO cout << "NO\n"

const ll INF = (ll)2e18 + 1386;
const ld EPS = 0.000000000000001;
const int MOD = 1e9 + 7;

inline int _add(int a, int b){ int res = a + b; return (res >= MOD ? res - MOD : res); }
inline int _neg(int a, int b){ int res = (abs(a - b) < MOD ? a - b : (a - b) % MOD); return (res < 0 ? res + MOD : res); }
inline int _mlt(ll a, ll b){ return (a * b % MOD); }
inline void fileIO(string i, string o){ freopen(i.c_str(), "r", stdin); freopen(o.c_str(), "w", stdout); }

const int MAXN = 103;

int n, w, a[MAXN], b[MAXN];

int minValue(int N, int W) {
    n = N, w = W;
    fill(a, a + n, 0);
    a[0] = 1;
    playRound(a, b);
    if (b[0] == 1) return 0;
    for (int i = 0; i < n; i++){
        if (b[i] == 0) return i;
    }
    return -1;
}

int maxValue(int N, int W) {
    n = N, w = W;
    VI cand, nxt;
    bitset<MAXN> incand;
    incand.reset();
    fill(a, a + n, 1);
    playRound(a, b);
    for (int i = 0; i < n; i++){
        if (b[i] > a[i]){
            cand.PB(i);
            incand[i] = 1;
        }
    }

    fill(a, a + n, 0);
    for (int i : cand) a[i] = 2;
    playRound(a, b);
    for (int i : cand){
        if (b[i] > a[i]) nxt.PB(i);
        else incand[i] = 0;
    }
    cand = nxt; nxt.clear();

    fill(a, a + n, 0);
    for (int i : cand) a[i] = 4;
    playRound(a, b);
    for (int i : cand){
        if (b[i] > a[i]) nxt.PB(i);
        else incand[i] = 0;
    }
    cand = nxt; nxt.clear();

    fill(a, a + n, 0);
    for (int i : cand) a[i] = 11;
    playRound(a, b);
    for (int i : cand){
        if (b[i] > a[i]) nxt.PB(i);
        else incand[i] = 0;
    }
    cand = nxt; nxt.clear();
    return cand[0];
}

int greaterValue(int N, int W) {
    // TODO: Implement Subtask 3 solution here.
    // You may leave this function unmodified if you are not attempting this
    // subtask.
    return 0;
}

int uhm = 0;

bool cmp(int i, int j){
    fill(a, a + n, 0);
    a[i] = a[j] = 100;
    playRound(a, b);
    uhm++;
    if (uhm >= 700) assert(0);
    return b[j] > a[j];
}

void allValues(int N, int W, int *P) {
    n = N, w = W;
    if (w == 2*n) {
        VI vec;
        for (int i = 0; i < n; i++) vec.PB(i);
        sort(all(vec), cmp);
        for (int i = 0; i < n; i++) P[vec[i]] = i + 1;
    } else {
        // TODO: Implement Subtask 5 solution here.
        // You may leave this block unmodified if you are not attempting this
        // subtask.
    }
}

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 344 KB Output is correct
2 Correct 4 ms 600 KB Output is correct
3 Correct 3 ms 344 KB Output is correct
4 Correct 3 ms 344 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 460 KB Output is correct
2 Correct 10 ms 460 KB Output is correct
3 Correct 10 ms 344 KB Output is correct
4 Correct 10 ms 344 KB Output is correct

Subtask #3
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 29 ms 424 KB Output is correct
2 Runtime error 32 ms 600 KB Execution killed with signal 6
3 Halted 0 ms 0 KB -

Subtask #5
0 / 53.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -