oj.uz

Submission #400788

# Submission time Handle Problem Language Result Execution time Memory
400788 2021-05-08T16:24:15 Z my99n Koala Game (APIO17_koala) C++14
56 / 100
 102 ms 328 KB 
#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

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.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 312 KB Output is correct
2 Correct 6 ms 200 KB Output is correct
3 Correct 6 ms 200 KB Output is correct
4 Correct 6 ms 200 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 316 KB Output is correct
2 Correct 19 ms 312 KB Output is correct
3 Correct 18 ms 316 KB Output is correct
4 Correct 18 ms 200 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 96 ms 324 KB Output is correct
2 Correct 102 ms 312 KB Output is correct
3 Correct 95 ms 324 KB Output is correct
4 Correct 96 ms 320 KB Output is correct
5 Correct 96 ms 324 KB Output is correct
6 Correct 95 ms 324 KB Output is correct
7 Correct 95 ms 316 KB Output is correct
8 Correct 97 ms 316 KB Output is correct
9 Correct 95 ms 320 KB Output is correct
10 Correct 94 ms 328 KB Output is correct

Subtask #4
0 / 10.0

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

Subtask #5
19.0 / 53.0

# Verdict Execution time Memory Grader output
1 Partially correct 52 ms 200 KB Output is partially correct
2 Partially correct 72 ms 292 KB Output is partially correct
3 Partially correct 66 ms 200 KB Output is partially correct
4 Partially correct 67 ms 200 KB Output is partially correct
5 Partially correct 76 ms 300 KB Output is partially correct
6 Partially correct 76 ms 200 KB Output is partially correct
7 Partially correct 68 ms 292 KB Output is partially correct
8 Partially correct 67 ms 200 KB Output is partially correct
9 Partially correct 68 ms 292 KB Output is partially correct
10 Partially correct 63 ms 200 KB Output is partially correct
11 Partially correct 67 ms 200 KB Output is partially correct
12 Partially correct 45 ms 200 KB Output is partially correct
13 Partially correct 68 ms 288 KB Output is partially correct
14 Partially correct 69 ms 200 KB Output is partially correct
15 Partially correct 65 ms 200 KB Output is partially correct
16 Partially correct 68 ms 304 KB Output is partially correct
17 Partially correct 76 ms 200 KB Output is partially correct
18 Partially correct 77 ms 200 KB Output is partially correct
19 Partially correct 71 ms 200 KB Output is partially correct
20 Partially correct 68 ms 200 KB Output is partially correct
21 Partially correct 65 ms 200 KB Output is partially correct
22 Partially correct 70 ms 200 KB Output is partially correct
23 Partially correct 52 ms 200 KB Output is partially correct
24 Partially correct 70 ms 320 KB Output is partially correct
25 Partially correct 68 ms 292 KB Output is partially correct
26 Partially correct 73 ms 304 KB Output is partially correct
27 Partially correct 67 ms 296 KB Output is partially correct
28 Partially correct 69 ms 200 KB Output is partially correct
29 Partially correct 67 ms 304 KB Output is partially correct
30 Partially correct 67 ms 308 KB Output is partially correct
31 Partially correct 65 ms 200 KB Output is partially correct
32 Partially correct 68 ms 320 KB Output is partially correct
33 Partially correct 68 ms 288 KB Output is partially correct
34 Partially correct 60 ms 200 KB Output is partially correct
35 Partially correct 70 ms 200 KB Output is partially correct
36 Partially correct 63 ms 200 KB Output is partially correct
37 Partially correct 68 ms 200 KB Output is partially correct
38 Partially correct 65 ms 292 KB Output is partially correct
39 Partially correct 67 ms 200 KB Output is partially correct
40 Partially correct 72 ms 296 KB Output is partially correct