oj.uz

답안 #972265

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
972265 2024-04-30T10:12:04 Z vjudge1 코알라 (APIO17_koala) C++14
11 / 100
 15 ms 596 KB 
#include "koala.h"

#include <bits/stdc++.h>

using namespace std;

int a[110], b[110];

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.
   a[0]=1;
   playRound(a, b);
   for (int i=1; i<N; ++i) if (b[i]==0) return i;
   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.
   for (int i=0; i<N; ++i){
      a[i]=1;
   }
   playRound(a, b);
   // for (int i=0; i<N; ++i) if (b[i]) cout << i+1 << ' ';
   // cout << '\n';
   for (int i=0; i<N; ++i){
      a[i]=(b[i]>a[i] && a[i])?2:0;
   }
   playRound(a, b);
   // for (int i=0; i<N; ++i) if (b[i]) cout << i+1 << ' ';
   // cout << '\n';
   for (int i=0; i<N; ++i){
      a[i]=(b[i]>a[i] && a[i])?4:0;
   }
   playRound(a, b);
   // for (int i=0; i<N; ++i) if (b[i]) cout << i+1 << ' ';
   // cout << '\n';
   for (int i=0; i<N; ++i){
      a[i]=(b[i]>a[i] && a[i])?9:0;
   }
   playRound(a, b);
   // for (int i=0; i<N; ++i) if (b[i]) cout << i+1 << ' ';
   // cout << '\n';
   for (int i=0; i<N; ++i){
      a[i]=(b[i]>a[i] && a[i])?10:0;
   }
   playRound(a, b);
   for (int i=0; i<N; ++i) if (b[i]>a[i] && a[i]) return i;
   // for (int i=0; i<N; ++i) if (b[i]) cout << i+1 << ' ';
   // cout << '\n';
   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.
   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

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

Subtask #2
7.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 15 ms 596 KB Output is partially correct
2 Partially correct 12 ms 344 KB Output is partially correct
3 Partially correct 12 ms 344 KB Output is partially correct
4 Partially correct 14 ms 344 KB Output is partially correct

Subtask #3
0 / 18.0

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

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 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 -