oj.uz

Submission #899301

# Submission time Handle Problem Language Result Execution time Memory
899301 2024-01-05T17:09:33 Z AdamGS Koala Game (APIO17_koala) C++17
43 / 100
 59 ms 724 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;
}

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;
    } 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

# Verdict Execution time Memory Grader output
1 Correct 3 ms 344 KB Output is correct
2 Correct 3 ms 344 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

# Verdict Execution time Memory Grader output
1 Correct 10 ms 344 KB Output is correct
2 Correct 10 ms 456 KB Output is correct
3 Correct 10 ms 344 KB Output is correct
4 Correct 10 ms 344 KB Output is correct

Subtask #3
14.0 / 18.0

# Verdict Execution time Memory Grader output
1 Partially correct 51 ms 472 KB Output is partially correct
2 Partially correct 59 ms 480 KB Output is partially correct
3 Partially correct 52 ms 712 KB Output is partially correct
4 Partially correct 49 ms 476 KB Output is partially correct
5 Partially correct 50 ms 456 KB Output is partially correct
6 Partially correct 53 ms 468 KB Output is partially correct
7 Partially correct 49 ms 480 KB Output is partially correct
8 Partially correct 50 ms 476 KB Output is partially correct
9 Partially correct 51 ms 724 KB Output is partially correct
10 Partially correct 49 ms 476 KB Output is partially correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 344 KB Output is correct
2 Correct 28 ms 452 KB Output is correct
3 Correct 28 ms 344 KB Output is correct
4 Correct 27 ms 344 KB Output is correct
5 Correct 27 ms 344 KB Output is correct
6 Correct 32 ms 344 KB Output is correct
7 Correct 27 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 344 KB Output is correct
11 Correct 28 ms 344 KB Output is correct
12 Correct 12 ms 344 KB Output is correct
13 Correct 27 ms 452 KB Output is correct
14 Correct 24 ms 344 KB Output is correct
15 Correct 25 ms 344 KB Output is correct
16 Correct 25 ms 452 KB Output is correct
17 Correct 25 ms 344 KB Output is correct
18 Correct 25 ms 444 KB Output is correct
19 Correct 25 ms 344 KB Output is correct
20 Correct 25 ms 344 KB Output is correct

Subtask #5
0 / 53.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -