oj.uz

답안 #978394

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
978394 2024-05-09T07:50:30 Z hmm789 코알라 (APIO17_koala) C++14
96 / 100
 48 ms 1880 KB 
#include "koala.h"
#include <bits/stdc++.h>
using namespace std;
 
int minValue(int N, int W) {
    int a[N], b[N];
    a[0] = 1;
    for(int i = 1; i < N; i++) a[i] = 0;
    playRound(a, b);
    for(int i = 0; i < N; i++) if(!b[i]) return i;
    return 0;
}
 
int maxValue(int N, int W) {
    int a[N], b[N];
    for(int i = 0; i < N; i++) a[i] = 1;
    playRound(a, b);
    set<int> s;
    for(int i = 0; i < N; i++) if(b[i]) s.insert(i);
    memset(a, 0, sizeof(a));
    for(int i : s) a[i] = 2;
    playRound(a, b);
    for(int i = 0; i < N; i++) if(s.find(i) != s.end() && !b[i]) s.erase(i);
    memset(a, 0, sizeof(a));
    for(int i : s) a[i] = 4;
    playRound(a, b);
    for(int i = 0; i < N; i++) if(s.find(i) != s.end() && !b[i]) s.erase(i);
    memset(a, 0, sizeof(a));
    for(int i : s) a[i] = 11;
    playRound(a, b);
    for(int i = 0; i < N; i++) if(s.find(i) != s.end() && !b[i]) s.erase(i);
    return *s.begin();
}
 
int greaterValue(int N, int W) {
    int a[N], b[N];
    memset(a, 0, sizeof(a));
    int l = 1, r = 9, m;
    while(l <= r) {
        m = (l+r)/2;
        a[0] = a[1] = m;
        playRound(a, b);
        if(b[0] && b[1]) l = m+1;
        else if(!b[0] && !b[1]) r = m-1;
        else if(b[0] && !b[1]) return 0;
        else return 1;
    }
    return 0;
}
 
int a[100], b[100], c[100], tmp[100];
bool cmp(int x, int y) {
    if(x == y) return false;
    a[x] = a[y] = 100;
    playRound(a, b);
    a[x] = a[y] = 0;
    return b[y] > 100;
}
 
void srt(int l, int r) {
    if(l == r) return;
    int m = (l+r)/2;
    srt(l, m);
    srt(m+1, r);
    int i = l, j = m+1, idx = l;
    while(i <= m || j <= r) {
        if(i > m) tmp[idx++] = c[j++];
        else if(j > r) tmp[idx++] = c[i++];
        else if(cmp(c[i], c[j])) tmp[idx++] = c[i++];
        else tmp[idx++] = c[j++];
    }
    for(int i = l; i <= r; i++) c[i] = tmp[i];
}
 
int ans[100];
 
void solve(int l, int r, int c, vector<int> pos) {
	//cout << l << " " << r << endl;
	if(l > r) return;
	if(pos.empty()) return;
	if(l == r) {
		//cout << l << " " << pos[0] << endl;
		ans[pos[0]] = l;
		return;
	}
	if(c == 0) c = min(100/(r-l+1), 8);
	memset(a, 0, sizeof(a));
	for(int i : pos) a[i] = c;
	playRound(a, b);
	
	//
	int B[100], R[100], P[100], N = 100, W = 100;
	for(int i = 0; i < 100; i++) P[i] = i+1;
	memset(B, 0, sizeof(B));
	for(int i = l-1; i < r; i++) B[i] = c;
	int cache[2][205];
    int num[2][205];
    char taken[105][205];
    for (int i=0;i<205;++i) {
        cache[1][i] = 0;
        num[1][i] = 0;
    }
    for (int i=0;i<N;++i) {
		//cout << "b " << i << endl;
        int v = B[i]+1;
        int ii = i&1;
        int o = ii^1;
        for (int j=0;j<=W;++j) {
            cache[ii][j] = cache[o][j];
            num[ii][j] = num[o][j];
            taken[i][j] = 0;
        }
        for (int j=W;j>=v;--j) {
            int h = cache[o][j-v] + P[i];
            int hn = num[o][j-v] + 1;
            if (h > cache[ii][j] || (h == cache[ii][j] && hn > num[ii][j])) {
                cache[ii][j] = h;
                num[ii][j] = hn;
                taken[i][j] = 1;
            } else {
                taken[i][j] = 0;
            }
        }
    }
    int cur = W;
    for (int i=N-1;i>=0;--i) {
        R[i] = taken[i][cur] ? (B[i] + 1) : 0;
        cur -= R[i];
    }
    //
    int m = r+1;
    for(int i = r-1; i >= l-1; i--) if(R[i] > B[i]) m = i+1;
    vector<int> v1, v2;
    for(int i : pos) {
		if(b[i] > a[i]) v2.push_back(i);
		else v1.push_back(i);
	}
	//cout << "a " << l << " " << m << " " << r << " " << c << endl;
	//for(int i : v1) cout << i << " ";
	//cout << endl;
	//for(int i : v2) cout << i << " ";
	//cout << endl;
	if(v2.size() == 0) {
		solve(l, m-1, c-1, v1);
	} else if(v1.size() == 0) {
		solve(m, r, c+1, v2);
	} else {
		solve(l, m-1, 0, v1);
		solve(m, r, 0, v2);
	}
}
 
void allValues(int N, int W, int *P) {
    if (W == 2*N) {
        for(int i = 0; i < N; i++) c[i] = i;
        srt(0, N-1);
        for(int i = 0; i < N; i++) P[c[i]] = i+1;
    } else {
		vector<int> v;
		for(int i = 0; i < 100; i++) v.push_back(i);
        solve(1, 100, 0, v);
        for(int i = 0; i < 100; i++) P[i] = ans[i];
    }
}

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 344 KB Output is correct
2 Correct 3 ms 456 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 11 ms 344 KB Output is correct
2 Correct 13 ms 600 KB Output is correct
3 Correct 11 ms 344 KB Output is correct
4 Correct 14 ms 464 KB Output is correct

Subtask #3
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 41 ms 344 KB Output is correct
2 Correct 47 ms 464 KB Output is correct
3 Correct 39 ms 480 KB Output is correct
4 Correct 39 ms 468 KB Output is correct
5 Correct 40 ms 480 KB Output is correct
6 Correct 40 ms 340 KB Output is correct
7 Correct 39 ms 472 KB Output is correct
8 Correct 40 ms 472 KB Output is correct
9 Correct 40 ms 480 KB Output is correct
10 Correct 48 ms 468 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 344 KB Output is correct
2 Correct 26 ms 352 KB Output is correct
3 Correct 25 ms 344 KB Output is correct
4 Correct 24 ms 344 KB Output is correct
5 Correct 24 ms 344 KB Output is correct
6 Correct 27 ms 340 KB Output is correct
7 Correct 25 ms 344 KB Output is correct
8 Correct 24 ms 344 KB Output is correct
9 Correct 24 ms 428 KB Output is correct
10 Correct 24 ms 344 KB Output is correct
11 Correct 25 ms 600 KB Output is correct
12 Correct 15 ms 600 KB Output is correct
13 Correct 24 ms 344 KB Output is correct
14 Correct 22 ms 344 KB Output is correct
15 Correct 22 ms 344 KB Output is correct
16 Correct 23 ms 344 KB Output is correct
17 Correct 23 ms 344 KB Output is correct
18 Correct 23 ms 452 KB Output is correct
19 Correct 22 ms 452 KB Output is correct
20 Correct 22 ms 344 KB Output is correct

Subtask #5
49.0 / 53.0

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