oj.uz

Submission #975525

# Submission time Handle Problem Language Result Execution time Memory
975525 2024-05-05T12:11:54 Z edogawa_something Koala Game (APIO17_koala) C++17
18 / 100
 39 ms 608 KB 
#include "koala.h"
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vii;
typedef pair<ll,ll> pii;
int b[100],r[100];
bool vis[100];
int minValue(int N, int W) {
  // TODO: Implement Subtask 1 solution here. 
  // You may leave this function unmodified if you are not attempting this
  // subtask.
  return 0;
}

int maxValue(int n, int W) {
  // TODO: Implement Subtask 2 solution here.
  // You may leave this function unmodified if you are not attempting this
  // subtask.
  return 0;
}

int greaterValue(int N, int W) {
    // TODO: Implement Subtask 3 solution here.
    // You may leave this function unmodified if you are not attempting this
    // subtask.
    int lx=1,rx=14,mid;
    while(lx<=rx){
      mid=((lx+rx)>>1);
      b[0]=b[1]=mid;
      playRound(b,r);
      if(b[0]<r[0]&&b[1]>=r[1])
      return 0;
      if(b[0]>=r[0]&&b[1]<r[1])
      return 1;
      if(b[0]>=r[0])
      rx=mid-1;
      else
      lx=mid+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
0 / 4.0

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

Subtask #2
0 / 15.0

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

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 596 KB Output is correct
2 Correct 39 ms 464 KB Output is correct
3 Correct 35 ms 484 KB Output is correct
4 Correct 34 ms 480 KB Output is correct
5 Correct 36 ms 472 KB Output is correct
6 Correct 34 ms 488 KB Output is correct
7 Correct 33 ms 608 KB Output is correct
8 Correct 33 ms 472 KB Output is correct
9 Correct 33 ms 484 KB Output is correct
10 Correct 33 ms 472 KB Output is correct

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 1 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -