oj.uz

Submission #1062746

# Submission time Handle Problem Language Result Execution time Memory
1062746 2024-08-17T10:16:23 Z bleahbleah Koala Game (APIO17_koala) C++17
4 / 100
 33 ms 468 KB 
#include "koala.h"
#include <bits/stdc++.h>
#define all(x) (x).begin(),(x).end()
using namespace std;

using ll = long long;
using ld = long double;

//#define int ll
#define sz(x) ((int)(x).size())

using pii = pair<int,int>;
using tii = tuple<int,int,int>;

namespace Query {
   int B[1001], R[1001];
   vector<int> query(vector<int> a) {
      for(int i = 0; i < sz(a); i++) B[i] = a[i];
      playRound(B, R);
      vector<int> r;
      for(int i = 0; i < sz(a); i++) r.emplace_back(R[i] > B[i]);
      return r;
   }
}

using Query::query;

int minValue(int N, int W) {
   vector<int> a(N);
   a[0] = 1;
   auto b = query(a);
   for(int i = 0; i < N; i++) if(b[i] == 0) return i;
}

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) {
   int l = 1, r = min(14, W / 2);
   while(r - l > 1) {
      int mid = (l + r) >> 1;
      vector<int> t(N, 0);
      t[0] = mid;
      t[1] = mid;
      auto q = query(t);
      if(q[0] + q[1] == 1) {
         return q[0] != 1;
      }
      if(q[0] + q[1] == 2)
         l = mid;
      else r = mid;
   }
   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:29:19: warning: control reaches end of non-void function [-Wreturn-type]
   29 |    vector<int> a(N);
      |                   ^

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 460 KB Output is correct
2 Correct 4 ms 344 KB Output is correct
3 Correct 3 ms 344 KB Output is correct
4 Correct 3 ms 344 KB Output is correct

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 468 KB Output is correct
2 Incorrect 1 ms 344 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 53.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -