Submission #975525

#	Time	Username	Problem	Language	Result	Execution time	Memory
975525		edogawa_something	코알라 (APIO17_koala)	C++17	18 / 100	39 ms	608 KiB

koala

#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
• Subtask 2: 0 / 15
• Subtask 3: 18 / 18
• Subtask 4: 0 / 10
• Subtask 5: 0 / 53