oj.uz

답안 #975522

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
975522 2024-05-05T12:01:46 Z edogawa_something 코알라 (APIO17_koala) C++17
15 / 100
 12 ms 344 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.
  ll cnt=100;
  for(int i=0;i<n;i++)
  vis[i]=1;
  while(cnt>1){
    for(int i=0;i<n;i++){
      if(vis[i])
      b[i]=min((100/cnt),(cnt-1));
      else
      b[i]=0;
    }
    if(cnt==9){
      for(int i=0;i<n;i++){
        if(vis[i])
        b[i]=11;
      }
    }
    cerr<<cnt<<'\n';
    playRound(b,r);
    cnt=0;
    for(int i=0;i<n;i++){
      if(vis[i]&&r[i]<=b[i])
      vis[i]=0;
      if(vis[i])
      cnt++;
    }
  }
  for(int i=0;i<n;i++){
    if(vis[i])
    return i;
  }
  return 1000;
}

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

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

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 344 KB Output is correct
2 Correct 12 ms 344 KB Output is correct
3 Correct 11 ms 344 KB Output is correct
4 Correct 11 ms 344 KB Output is correct

Subtask #3
0 / 18.0

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

Subtask #4
0 / 10.0

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

Subtask #5
0 / 53.0

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