Submission #400788

#	Time	Username	Problem	Language	Result	Execution time	Memory
400788		my99n	Koala Game (APIO17_koala)	C++14	56 / 100	102 ms	328 KiB

koala

#include "koala.h"
#include <bits/stdc++.h>
using namespace std;
int b[110], r[110];
 
void clear () {
  memset(b, 0, sizeof b);
  memset(r, 0, sizeof r);
}
 
int minValue(int N, int W) {
  clear();
  b[0] = 1; playRound(b, r);
  if (r[0] != 2) return 0;
  for (int i = 0; i < N; i++) {
    if (r[i] == 0) return i;
  }
  return -1;
}
 
int maxValue(int N, int W) {
  clear();
  vector<int> t;
  for (int i = 0; i < N; i++) b[i] = 1;
  playRound(b, r);
  for (int i = 0; i < N; i++) {
    if (r[i] > b[i]) t.push_back(i);
  }
 
  clear();
  for (auto x : t) b[x] = 2;
  playRound(b, r);
  t.clear();
  for (int i = 0; i < N; i++) {
    if (r[i] > 2) t.push_back(i);
  }
 
  clear();
  for (auto x : t) b[x] = 4;
  playRound(b, r);
  t.clear();
  for (int i = 0; i < N; i++) {
    if (r[i] > 4) t.push_back(i);
  }
 
  clear();
  for (auto x : t) b[x] = 11;
  playRound(b, r);
  t.clear();
  for (int i = 0; i < N; i++) {
    if (r[i] > 11) t.push_back(i);
  }
  
  return t[0];
}

int solve (int aa, int bb, int x) {
  int n = 100, w = 100;
  vector<int> gr;
  clear();
  gr.clear();
  b[aa] = x, b[bb] = x;
  playRound(b, r);
  // for (int i = 0; i < n; i++) if (r[i] == 1) one.push_back(i);
  for (int i = 0; i < n; i++) if (r[i] > 1 and r[i] > b[i]) gr.push_back(i); 
  if (gr.size() == 1) {
    if (gr[0] == aa) return 0;
    else return 1;
  }
  if (gr.size() == 0) return -100;
  if (gr.size() == 2) return 100;
  assert(false);
}

bool compare(int aa, int bb) {

  // cerr << aa << ' ' << bb << endl;
  // aa--; bb--;

  int n = 100, w = 100;
  // int mn = minValue(n, w);
 
  // if (mn == aa) return 1;
  // if (mn == bb) return 0;
 
  int s3 = solve(aa, bb, 3);
  // cerr << "s3 " << s3 << endl;
  if (s3 == 100) {
    int s6 = solve(aa, bb, 6);
    // cerr << "s6 " << s6 << endl;
    if (s6 == 100) return solve(aa, bb, 10);
    return s6;
  }
  else if (s3 == -100) {
    int mn = minValue(n, w);
    if (mn == aa) return 1;
    if (mn == bb) return 0;

    return solve(aa, bb, 2);
  }
  return s3;


  // vector<int> one, gr;
  // vector<int> xs; 
  // xs.push_back(2);
  // xs.push_back(3);
  // xs.push_back(6);
  // xs.push_back(10);
  // for (auto x : xs) {
  //   clear();
  //   gr.clear();
  //   b[aa] = x, b[bb] = x;
  //   playRound(b, r);
  //   for (int i = 0; i < n; i++) if (r[i] == 1) one.push_back(i);
  //   for (int i = 0; i < n; i++) if (r[i] > 1 and r[i] > b[i]) gr.push_back(i);
    
  //   // if (gr.size() == 1) {
  //   //   if (gr[0] == aa) return 0;
  //   //   else return 1;
  //   // }
  //   cout  << gr.size() << endl;
  // }
  // return -1;
}
 
int greaterValue(int N, int W) {
  return compare(0, 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 {
    vector<int> v;
    for (int i = 0; i < N; i++) {
      v.push_back(i);
    }
    sort(v.begin(), v.end(), compare);
    for (int i = 0; i < v.size(); i++) {
      P[v[i]] = i+1;
    }
  }
  return;
}

Compilation message (stderr)

koala.cpp: In function 'int solve(int, int, int)':
koala.cpp:58:16: warning: unused variable 'w' [-Wunused-variable]
   58 |   int n = 100, w = 100;
      |                ^
koala.cpp: In function 'void allValues(int, int, int*)':
koala.cpp:142:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  142 |     for (int i = 0; i < v.size(); i++) {
      |                     ~~^~~~~~~~~~

• Subtask 1: 4 / 4
• Subtask 2: 15 / 15
• Subtask 3: 18 / 18
• Subtask 4: 0 / 10
• Subtask 5: 19 / 53