oj.uz

답안 #267024

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
267024 2020-08-15T16:55:15 Z amoo_safar 코알라 (APIO17_koala) C++17
67 / 100
 63 ms 512 KB 
#include "koala.h"

#include <bits/stdc++.h>

#define pb push_back

using namespace std;

int greaterValue(int n, int w) {
    assert(n == w);
    return 0;
}

int Sum(int l, int r){
    return (l + r) * (r - l + 1) / 2;;
}


int dp[102][102];
int inp[100], out[100];
int ans[100], np, rq;

int minValue(int n, int w) {
    assert(n == w);

    memset(inp, 0, sizeof inp);
    memset(out, 0, sizeof out);
    inp[0] = 1;
    playRound(inp, out);
    for(int i = 0; i < n; i++) if(inp[i] >= out[i]) return i;
    return 0;
}


int maxValue(int n, int w) {
    int Ask[4] = {1, 2, 4, 11};
    vector<int> I(n);
    iota(I.begin(), I.end(), 0);
    for(int it = 0; it < 4; it ++){
        memset(inp, 0, sizeof inp);
        memset(out, 0, sizeof out);
        for(auto x : I) inp[x] = Ask[it];
        playRound(inp, out);
        
        I.clear();
        for(int i = 0; i < 100; i++){
            if(out[i] > inp[i]) I.pb(i);
        }
    }  
    return I[0];
}

bool CMP(int i, int j){
    memset(inp, 0, sizeof inp);
    memset(out, 0, sizeof out);
    inp[i] = np;
    inp[j] = np;
    playRound(inp, out);
    rq --;
    if(rq == 0) assert(false);
    return out[i] <= inp[i];
}


void Solve(vector<int> pos, int L, int R){
    //int n = np;
    if(L == R){
        ans[pos[0]] = L;
        return ;
    }
    int cnt = dp[L][R];
    memset(inp, 0, sizeof inp);
    for(auto x : pos)
        inp[x] = cnt;
    memset(out, 0, sizeof out);
    playRound(inp, out);
    vector<int> Le, Bi;
    for(int i = 0; i < np; i++){
        if(inp[i] > 0){
            if(inp[i] < out[i]){
                Bi.pb(i);
            } else {
                Le.pb(i);
            }
        }
    }
    /*
    if(Le.empty()){
        cerr << "! " << L << " " << R << " -> " << pos.size() << '\n';
        //for(int i = 0; i < 100; i++) cerr << inp[i] << ' ' << out[i] << '\n';
        cerr << '\n';
    }
    */
    assert(!Le.empty());
    assert(!Bi.empty());
    Solve(Le, L, L + Le.size() - 1);
    Solve(Bi, L + Le.size(), R);
}

void allValues(int n, int w, int *P) {
    np = n;
    if (w == 2 * n) {
        rq = 700;
        vector<int> I;
        I.pb(0);
        for(int i = 1; i < n; i++){
            int L = -1, R = I.size();
            while(L + 1 < R){
                int mid = (L + R) >> 1;
                if(CMP(I[mid], i)) L = mid;
                else R = mid;
            }
            I.insert(I.begin() + (L + 1), i);
        }
        for(int i = 0; i < n; i++)
            P[I[i]] = i + 1;
        return ;
    }
    for(int i = 1; i <= n; i++){
        for(int j = i + 1; j <= n; j++){
            int ln = j - i + 1;
            vector<int> A, B;
            for(int k = n; k >= 1; k--){
                if(i <= k && k <= j) A.pb(k);
                else B.pb(k);
            }
            int val = -1;
            for(int x = 1; x * ln <= n; x++){
                int mx = -1;
                vector<int> Mx;
                for(int cn = 0; cn <= ln; cn ++){
                    if(cn * (x + 1) > n) continue;
                    int res = 0;
                    for(int i2 = 0; i2 < cn; i2 ++) res += A[i2];
                    int cn2 = min(n - (cn * (x + 1)), (int) B.size());
                    for(int i2 = 0; i2 < cn2; i2 ++) res += B[i2];
                    if(res > mx){
                        mx = res;
                        Mx.clear();
                    }
                    if(res == mx) Mx.pb(cn);
                }
                if(!Mx.empty() && (Mx[0] != 0) && (Mx.back() != ln)){
                    val = x;
                }
            }
            dp[i][j] = val;
        }
    }
    
    vector<int> I(n);
    iota(I.begin(), I.end(), 0); 
    Solve(I, 1, n);

    for(int i = 0; i < n; i++)
        P[i] = ans[i];
}
/*
4 1
6 12 5 3 2 1 6 4

*/

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 384 KB Output is correct
2 Correct 6 ms 384 KB Output is correct
3 Correct 6 ms 384 KB Output is correct
4 Correct 8 ms 512 KB Output is correct

Subtask #2
0 / 15.0

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

Subtask #3
0 / 18.0

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

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 51 ms 384 KB Output is correct
2 Correct 47 ms 384 KB Output is correct
3 Correct 46 ms 384 KB Output is correct
4 Correct 46 ms 384 KB Output is correct
5 Correct 48 ms 504 KB Output is correct
6 Correct 46 ms 384 KB Output is correct
7 Correct 45 ms 380 KB Output is correct
8 Correct 49 ms 384 KB Output is correct
9 Correct 46 ms 384 KB Output is correct
10 Correct 46 ms 384 KB Output is correct
11 Correct 45 ms 384 KB Output is correct
12 Correct 41 ms 384 KB Output is correct
13 Correct 45 ms 384 KB Output is correct
14 Correct 44 ms 384 KB Output is correct
15 Correct 63 ms 384 KB Output is correct
16 Correct 47 ms 384 KB Output is correct
17 Correct 45 ms 384 KB Output is correct
18 Correct 45 ms 504 KB Output is correct
19 Correct 49 ms 384 KB Output is correct
20 Correct 45 ms 504 KB Output is correct

Subtask #5
53.0 / 53.0

# 결과 실행 시간 메모리 Grader output
1 Correct 51 ms 376 KB Output is correct
2 Correct 47 ms 504 KB Output is correct
3 Correct 47 ms 388 KB Output is correct
4 Correct 47 ms 376 KB Output is correct
5 Correct 50 ms 384 KB Output is correct
6 Correct 56 ms 376 KB Output is correct
7 Correct 53 ms 384 KB Output is correct
8 Correct 52 ms 504 KB Output is correct
9 Correct 48 ms 376 KB Output is correct
10 Correct 50 ms 384 KB Output is correct
11 Correct 47 ms 376 KB Output is correct
12 Correct 46 ms 384 KB Output is correct
13 Correct 46 ms 384 KB Output is correct
14 Correct 47 ms 512 KB Output is correct
15 Correct 47 ms 508 KB Output is correct
16 Correct 54 ms 376 KB Output is correct
17 Correct 48 ms 384 KB Output is correct
18 Correct 49 ms 384 KB Output is correct
19 Correct 50 ms 384 KB Output is correct
20 Correct 47 ms 384 KB Output is correct
21 Correct 55 ms 384 KB Output is correct
22 Correct 47 ms 384 KB Output is correct
23 Correct 49 ms 504 KB Output is correct
24 Correct 54 ms 384 KB Output is correct
25 Correct 48 ms 384 KB Output is correct
26 Correct 47 ms 384 KB Output is correct
27 Correct 47 ms 376 KB Output is correct
28 Correct 52 ms 384 KB Output is correct
29 Correct 49 ms 384 KB Output is correct
30 Correct 48 ms 384 KB Output is correct
31 Correct 47 ms 376 KB Output is correct
32 Correct 47 ms 384 KB Output is correct
33 Correct 48 ms 384 KB Output is correct
34 Correct 50 ms 504 KB Output is correct
35 Correct 48 ms 376 KB Output is correct
36 Correct 49 ms 376 KB Output is correct
37 Correct 47 ms 384 KB Output is correct
38 Correct 47 ms 512 KB Output is correct
39 Correct 47 ms 384 KB Output is correct
40 Correct 47 ms 384 KB Output is correct