oj.uz

답안 #1004105

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1004105 2024-06-21T05:23:01 Z GrindMachine 코알라 (APIO17_koala) C++17
33 / 100
 40 ms 464 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*

read some solutions long time back, remember some ideas from there

*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

#include "koala.h"

vector<int> query(vector<int> a){
    int n = sz(a);
    int arr[n];
    rep(i,n) arr[i] = a[i];
    int res_arr[n];
    playRound(arr,res_arr);
    vector<int> res(n);
    rep(i,n) res[i] = res_arr[i];
    return res;
}

int minValue(int n, int w) {
    // TODO: Implement Subtask 1 solution here.
    // You may leave this function unmodified if you are not attempting this
    // subtask.
    vector<int> a(n);
    a[0] = 1;
    auto res = query(a);
    int pos1 = -1;
    rep(i,n){
        if(!res[i]){
            pos1 = i;
        }
    }

    return pos1;
}

int maxValue(int n, int w) {
    // TODO: Implement Subtask 2 solution here.
    // You may leave this function unmodified if you are not attempting this
    // subtask.
    vector<int> cands;
    rep(i,n) cands.pb(i);

    while(sz(cands) > 1){
        int siz = sz(cands);
        int mx = 2*w-(n-siz);
        int x = mx/siz-1;

        vector<int> a(n);
        trav(i,cands) a[i] = x;

        auto res = query(a);
        vector<int> cands2;

        trav(i,cands){
            if(res[i] > x){
                cands2.pb(i);
            }
        }

        cands = cands2;
    }

    return cands[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.
    int lo = 1, hi = 20;
    while(lo <= hi){
        int mid = (lo+hi) >> 1;
        vector<int> a(n);
        a[0] = a[1] = mid-1;
        auto res = query(a);
        int pick0 = res[0] > a[0];
        int pick1 = res[1] > a[1];
        if(pick0^pick1){
            if(pick0) return 0;
            else return 1;
        }

        if(!pick0){
            hi = mid-1;
        }
        else{
            lo = mid+1;
        }
    }

    assert(0);
    return 0;
}

void allValues(int N, int W, int *P) {
    if (W == 2*N) {
        // TODO: Implement Subtask 4 solution here.
        // You may leave this block unmodified if you are not attempting this
        // subtask.
    } 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 2 ms 344 KB Output is correct
2 Correct 2 ms 344 KB Output is correct
3 Correct 2 ms 452 KB Output is correct
4 Correct 2 ms 344 KB Output is correct

Subtask #2
15.0 / 15.0

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

Subtask #3
14.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 29 ms 464 KB Output is correct
2 Partially correct 37 ms 344 KB Output is partially correct
3 Correct 28 ms 344 KB Output is correct
4 Partially correct 37 ms 344 KB Output is partially correct
5 Partially correct 40 ms 464 KB Output is partially correct
6 Correct 31 ms 344 KB Output is correct
7 Correct 30 ms 344 KB Output is correct
8 Partially correct 33 ms 344 KB Output is partially correct
9 Partially correct 32 ms 344 KB Output is partially correct
10 Partially correct 31 ms 344 KB Output is partially correct

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 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 -