oj.uz

답안 #267006

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

#include <bits/stdc++.h>

#define pb push_back

using namespace std;

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

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

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;



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(n);
        iota(I.begin(), I.end(), 0);
        sort(I.begin(), I.end(), CMP);
        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
0 / 4.0

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

Subtask #2
0 / 15.0

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

Subtask #3
0 / 18.0

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

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 53 ms 384 KB Output is correct
2 Runtime error 60 ms 504 KB Execution killed with signal 11 (could be triggered by violating memory limits)
3 Halted 0 ms 0 KB -

Subtask #5
53.0 / 53.0

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