oj.uz

답안 #200377

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
200377 2020-02-06T12:56:58 Z Nordway 코알라 (APIO17_koala) C++14
33 / 100
 202 ms 504 KB 
#include "koala.h"
#include<bits/stdc++.h>
#define pb push_back
#define sz(v) v.size()

using namespace std;


int b[111],R[111];

int minValue(int N, int W) {
  b[0]=1;
  playRound(b,R);
  int w=0;
  for(int i=0;i<N;i++){
    if(R[i]==0)return i;
  }
  return 0;
}

int maxValue(int N, int W) {
  vector<int>v;
  for(int i=0;i<N;i++){
    v.pb(i);
  }
  while(sz(v)>1){
    int k=W/sz(v);
    for(int i=0;i<N;i++)b[i]=0;
    for(int i=0;i<sz(v);i++)b[v[i]]=k;
    playRound(b,R);
    v.clear();
    for(int i=0;i<N;i++){
      if(R[i]>k)v.pb(i);
    }
  }
  return v[0];
}

int greaterValue(int N, int W) {
  int l=1,r=7,res=0;
  while(l<=r){
    int mid=(l+r)/2;
    b[0]=mid;
    b[1]=mid;
    playRound(b,R);
    if(R[0]+R[1]<=2*mid+1)r=mid-1;
    else l=mid+1,res=mid;
  }
  b[0]=res+1;
  b[1]=res+1;
  playRound(b,R);
  if(R[0]>R[1])return 0;
  return 1;
}

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

Compilation message

koala.cpp: In function 'int minValue(int, int)':
koala.cpp:14:7: warning: unused variable 'w' [-Wunused-variable]
   int w=0;
       ^
koala.cpp: In function 'int maxValue(int, int)':
koala.cpp:29:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<sz(v);i++)b[v[i]]=k;
                  ^

Subtask #1
4.0 / 4.0

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

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 22 ms 376 KB Output is correct
2 Correct 22 ms 248 KB Output is correct
3 Correct 23 ms 376 KB Output is correct
4 Correct 21 ms 248 KB Output is correct

Subtask #3
14.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 195 ms 376 KB Output is partially correct
2 Partially correct 176 ms 376 KB Output is partially correct
3 Partially correct 192 ms 248 KB Output is partially correct
4 Partially correct 196 ms 376 KB Output is partially correct
5 Partially correct 195 ms 504 KB Output is partially correct
6 Partially correct 195 ms 376 KB Output is partially correct
7 Partially correct 192 ms 248 KB Output is partially correct
8 Partially correct 202 ms 376 KB Output is partially correct
9 Partially correct 196 ms 376 KB Output is partially correct
10 Partially correct 195 ms 248 KB Output is partially correct

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 248 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 53.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 248 KB Output isn't correct
2 Halted 0 ms 0 KB -