oj.uz

답안 #899334

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
899334 2024-01-05T19:36:53 Z AdamGS 코알라 (APIO17_koala) C++17
80 / 100
 57 ms 596 KB 
#include "koala.h"
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(a, b) for(int a = 0; a < (b); ++a)
#define st first
#define nd second
#define pb push_back
#define all(a) a.begin(), a.end()
int minValue(int N, int W) {
  int P[N], T[N];
  rep(i, N) P[i]=0;
  P[0]=1;
  playRound(P, T);
  rep(i, N) if(P[i]>=T[i]) return i;
  return 0;
}

int maxValue(int N, int W) {
  int P[N], T[N];
  vector<int>V(N);
  rep(i, N) V[i]=0;
  int ans=-1;
  while(true) {
    int ile=N;
    rep(i, N) if(V[i]) --ile;
    if(ile==1) {
      rep(i, N) if(!V[i]) ans=i;
      break;
    }
    rep(i, N) if(V[i]) P[i]=0; else P[i]=W/ile;
    playRound(P, T);
    rep(i, N) if(P[i]>=T[i]) V[i]=1;
    int ans=0;
    rep(i, N) if(!V[i]) ++ans;
  }
  return ans;
}

int greaterValue(int N, int W) {
  int P[N], T[N], po=1, ko=8;
  rep(i, N) P[i]=0;
  while(po<ko) {
    int sr=(po+ko)/2;
    P[0]=P[1]=sr;
    playRound(P, T);
    if(T[0]>sr && T[1]<=sr) return 0;
    if(T[0]<=sr && T[1]>sr) return 1;
    if(T[0]>sr) po=sr+1; else ko=sr-1;
  }
  P[0]=P[1]=po;
  playRound(P, T);
  if(T[0]<=po) return 1;
  return 0;
}

bool comp(int a, int b) {
  int P[100], T[100];
  rep(i, 100) P[i]=0;
  P[a]=P[b]=100;
  playRound(P, T);
  if(T[a]<=P[a]) return true;
  return false;
}

bool comp2(int a, int b) {
  int N=100;
  int P[N], T[N], po=6, ko=8;
  rep(i, N) P[i]=0;
  while(po<ko) {
    int sr=(po+ko+1)/2;
    P[a]=P[b]=sr;
    playRound(P, T);
    if(T[a]>sr && T[b]<=sr) return 0;
    if(T[a]<=sr && T[b]>sr) return 1;
    if(T[a]>sr) po=sr+1; else ko=sr-1;
  }
  P[a]=P[b]=po;
  playRound(P, T);
  if(T[a]<=po) return 1;
  return 0;
}

vector<int>znajdz50() {
  vector<int>ans, czy(100);
  rep(j, 50) {
    int P[100], T[100];
    rep(i, 100) P[i]=czy[i];
    int k=j+1;
    rep(i, 100) if(!czy[i] && k) {
      P[i]=1;
      --k;
    }
    playRound(P, T);
    rep(i, 100) if(!czy[i] && P[i]>=T[i]) {
      czy[i]=1;
      ans.pb(i);
    }
  }
  return ans;
}

void allValues(int N, int W, int *P) {
  if (W == 2*N) {
    int T[N];
    rep(i, N) T[i]=i;
    stable_sort(T, T+N, comp);
    rep(i, N) P[T[i]]=i+1;
    return;
  }
  vector<int>V=znajdz50(), odw(100);
  for(auto i : V) odw[i]=1;
  int T[50], l=0;
  rep(i, 100) if(!odw[i]) T[l++]=i;
  stable_sort(T, T+50, comp2);
  rep(i, 50) {
    P[V[i]]=i+1;
    P[T[i]]=i+51;
  }
}

Subtask #1
4.0 / 4.0

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

Subtask #2
15.0 / 15.0

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

Subtask #3
14.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 49 ms 476 KB Output is partially correct
2 Partially correct 57 ms 464 KB Output is partially correct
3 Partially correct 47 ms 344 KB Output is partially correct
4 Partially correct 47 ms 464 KB Output is partially correct
5 Partially correct 48 ms 464 KB Output is partially correct
6 Partially correct 48 ms 480 KB Output is partially correct
7 Partially correct 48 ms 456 KB Output is partially correct
8 Partially correct 48 ms 480 KB Output is partially correct
9 Partially correct 48 ms 464 KB Output is partially correct
10 Partially correct 48 ms 452 KB Output is partially correct

Subtask #4
10.0 / 10.0

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

Subtask #5
37.0 / 53.0

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