oj.uz

답안 #972322

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
972322 2024-04-30T10:52:37 Z vjudge1 코알라 (APIO17_koala) C++14
33 / 100
 60 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])?11: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.
   for (int i=0; i<N; ++i){
      a[i]=1;
   }
   playRound(a, b);
   if ((b[0]>a[0])!=(b[1]>a[1])){
      if (b[0]>a[0]) return 0;
      return 1;
   }
   if (b[0]>a[0] && b[0]>a[1]){
      for (int i=0; i<N; ++i) a[i]=(i==0 || i==1)?10:0;
      playRound(a, b);
      if (b[0]>a[0]) return 0;
      return 1;
   }
   // bitset<1225> bs[11];
   // for (int i=0; i<=10; ++i) bs[i].reset();
   // for (int v=1; v<=10; ++v){
   //    int cur=0;
   //    for (int x=0; x<N; ++x) for (int y=x+1; y<N; ++y) if (x<50 && y<50){
   //       for (int i=0; i<N; ++i) a[i]=(i==x || i==y)?v:0;
   //       playRound(a, b);
   //       bs[v].set(cur++, b[x]!=b[y]);
   //    }
   // }
   // for (int i=0; i<1024; ++i){
   //    bitset<1225> tot;
   //    for (int j=0; j<10; ++j) if (i>>j&1) tot|=bs[j+1];
   //    if (tot.all()){
   //       for (int j=0; j<10; ++j) if (i>>j&1) cout << j+1 << ' ';
   //       cout << '\n';
   //    }
   // }
   for (int v:{1, 3, 6}){
      for (int i=0; i<N; ++i) a[i]=(i==0 || i==1)?v:0;
      playRound(a, b);
      if ((b[0]>a[0])!=(b[1]>a[1])){
         if (b[0]>a[0]) return 0;
         return 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
4.0 / 4.0

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

Subtask #2
15.0 / 15.0

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

Subtask #3
14.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 51 ms 476 KB Output is partially correct
2 Partially correct 60 ms 472 KB Output is partially correct
3 Partially correct 60 ms 460 KB Output is partially correct
4 Partially correct 52 ms 472 KB Output is partially correct
5 Partially correct 52 ms 468 KB Output is partially correct
6 Partially correct 51 ms 468 KB Output is partially correct
7 Partially correct 50 ms 480 KB Output is partially correct
8 Partially correct 53 ms 460 KB Output is partially correct
9 Partially correct 50 ms 464 KB Output is partially correct
10 Partially correct 49 ms 464 KB Output is partially correct

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