oj.uz

답안 #400733

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
400733 2021-05-08T15:34:49 Z my99n 코알라 (APIO17_koala) C++14
30 / 100
 180 ms 440 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];
}

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;
 
  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 <<  one.size() << ' ' << gr.size() << endl;
  }
  assert(false);
}
 
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 (auto x : v) {
    //   cerr << x << ' ';
    // } cerr << endl;
    for (int i = 0; i < v.size(); i++) {
      P[v[i]] = i+1;
    }
  }
  return;
}

Compilation message

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

Subtask #1
4.0 / 4.0

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

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 200 KB Output is correct
2 Correct 20 ms 316 KB Output is correct
3 Correct 19 ms 200 KB Output is correct
4 Correct 18 ms 200 KB Output is correct

Subtask #3
11.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 178 ms 312 KB Output is partially correct
2 Partially correct 174 ms 320 KB Output is partially correct
3 Partially correct 179 ms 440 KB Output is partially correct
4 Partially correct 176 ms 324 KB Output is partially correct
5 Partially correct 177 ms 320 KB Output is partially correct
6 Partially correct 177 ms 304 KB Output is partially correct
7 Partially correct 177 ms 328 KB Output is partially correct
8 Partially correct 178 ms 324 KB Output is partially correct
9 Partially correct 180 ms 320 KB Output is partially correct
10 Partially correct 175 ms 328 KB Output is partially correct

Subtask #4
0 / 10.0

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

Subtask #5
0 / 53.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 105 ms 292 KB Output is partially correct
2 Incorrect 133 ms 292 KB Output isn't correct
3 Halted 0 ms 0 KB -