oj.uz

Submission #899286

# Submission time Handle Problem Language Result Execution time Memory
899286 2024-01-05T16:51:54 Z AdamGS Koala Game (APIO17_koala) C++17
19 / 100
 11 ms 448 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 T[N], P[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;
}

void allValues(int N, int W, int *P) {
    if (W == 2*N) {
        // TODO: Implement Subtask 4 solution here.
        // You may leave this block unmodified if you are not attempting this
        // subtask.
    } 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 4 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 11 ms 448 KB Output is correct
2 Correct 10 ms 344 KB Output is correct
3 Correct 10 ms 344 KB Output is correct
4 Correct 10 ms 448 KB Output is correct

Subtask #3
0 / 18.0

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

Subtask #4
0 / 10.0

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

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 -