oj.uz

Submission #70202

# Submission time Handle Problem Language Result Execution time Memory
70202 2018-08-22T13:24:28 Z funcsr Koala Game (APIO17_koala) C++17
82 / 100
 895 ms 1248 KB 
#include "koala.h"
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <string>
#include <cstring>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <cmath>
#include <iomanip>
#include <cassert>
#include <bitset>
using namespace std;

typedef pair<int, int> P;
#define rep(i, n) for (int i=0; i<(n); i++)
#define all(c) (c).begin(), (c).end()
#define uniq(c) c.erase(unique(all(c)), (c).end())
#define index(xs, x) (int)(lower_bound(all(xs), x) - xs.begin())
#define _1 first
#define _2 second
#define pb push_back
#define INF 1145141919
#define MOD 1000000007

int N, W;
tuple<int,int,int> dp[201];
int simulation(vector<int> cost, int l, int r) {
  rep(i, W+1) dp[i] = make_tuple(0, 0, 0);
  rep(i, N) {
    assert(cost[i] > 0);
    for (int j=W-cost[i]; j>=0; j--) {
      dp[j+cost[i]] = max(dp[j+cost[i]], make_tuple(get<0>(dp[j])+(i+1), get<1>(dp[j])+1, get<2>(dp[j])-(l<=i+1&&i+1<=r)));
    }
  }
  int lo = -get<2>(dp[W]);
  rep(i, W+1) dp[i] = make_tuple(0, 0, 0);
  rep(i, N) {
    assert(cost[i] > 0);
    for (int j=W-cost[i]; j>=0; j--) {
      dp[j+cost[i]] = max(dp[j+cost[i]], make_tuple(get<0>(dp[j])+(i+1), get<1>(dp[j])+1, get<2>(dp[j])+(l<=i+1&&i+1<=r)));
    }
  }
  int hi = get<2>(dp[W]);
  assert(lo==hi);
  return lo;
}

int perm[100];
void solve(int l, int r, vector<int> set) {
  assert(r-l+1 == set.size());
  assert(l<=r);
  //cout<<"["<<l<<","<<r<<"] {";for(int x: set)cout<<x<<",";cout<<"}\n";
  if (l == r) {
    perm[set[0]] = l;
    return;
  }
  pair<int, P> mp = make_pair(INF, P(-1, -1));

  for (int outside=1; outside<=100; outside++) {
    for (int k=2; k<=100; k++) {
      if ((outside-1)*(N-(r-l+1)) + (k-1)*(r-l+1) > W) continue;
      vector<int> cost(N);
      for (int i=1; i<=N; i++) {
        if (l <= i && i <= r) cost[i-1] = k;
        else cost[i-1] = outside;
      }
      int left = simulation(cost, l, r);
      int right = (r-l+1)-left;
      if (left==0||right==0)continue;
      mp = min(mp, make_pair(abs(left-right), P(k, outside)));
      if (mp._1 <= 1) break;
    }
    if (mp._1 <= 1) break;
  }
  int val = mp._2._1;
  int outside = mp._2._2;
  //cout<<"val="<<val<<", outside="<<outside<<": "<<mp._1<<"\n";
  assert(val!=-1);

  int B[100], R[100];
  rep(i, N) B[i] = outside-1;
  for (int i : set) B[i] = val-1;
  playRound(B, R);
  vector<int> left, right;
  for (int i : set) {
    if (R[i] >= val) right.pb(i);
    else left.pb(i);
  }

  solve(l, l+left.size()-1, left);
  solve(l+left.size(), r, right);
}
int solve2(int l, int r, vector<int> set) {
  assert(r-l+1 == set.size());
  assert(l<=r);
  //cout<<"["<<l<<","<<r<<"] {";for(int x: set)cout<<x<<",";cout<<"}\n";
  if (l == r) return set[0];
  pair<int, P> mp = make_pair(INF, P(-1, -1));

  for (int outside=1; outside<=100; outside++) {
    for (int k=2; k<=100; k++) {
      if ((outside-1)*(N-(r-l+1)) + (k-1)*(r-l+1) > W) continue;
      vector<int> cost(N);
      for (int i=1; i<=N; i++) {
        if (l <= i && i <= r) cost[i-1] = k;
        else cost[i-1] = outside;
      }
      int right = simulation(cost, l, r);
      int left = (r-l+1)-right;
      if (right==0) continue;
      mp = min(mp, make_pair(right, P(k, outside)));
      if (mp._1 <= 1) break;
    }
    if (mp._1 <= 1) break;
  }
  int val = mp._2._1;
  int outside = mp._2._2;
  //cout<<"val="<<val<<", outside="<<outside<<": "<<mp._1<<"\n";
  assert(val!=-1);

  int B[100], R[100];
  rep(i, N) B[i] = outside-1;
  for (int i : set) B[i] = val-1;
  playRound(B, R);
  vector<int> left, right;
  for (int i : set) {
    if (R[i] >= val) right.pb(i);
    else left.pb(i);
  }
  return solve2(l+left.size(), r, right);
}
bool solve3(int l, int r, vector<int> set, int a, int b) {
  assert(r-l+1 == set.size());
  assert(l<r);
  //cout<<"["<<l<<","<<r<<"] {";for(int x: set)cout<<x<<",";cout<<"}\n";
  pair<int, P> mp = make_pair(INF, P(-1, -1));

  for (int outside=1; outside<=100; outside++) {
    for (int k=2; k<=100; k++) {
      if ((outside-1)*(N-(r-l+1)) + (k-1)*(r-l+1) > W) continue;
      vector<int> cost(N);
      for (int i=1; i<=N; i++) {
        if (l <= i && i <= r) cost[i-1] = k;
        else cost[i-1] = outside;
      }
      int right = simulation(cost, l, r);
      int left = (r-l+1)-right;
      if (left==0||right==0) continue;
      mp = min(mp, make_pair(abs(left-right), P(k, outside)));
      if (mp._1 <= 1) break;
    }
    if (mp._1 <= 1) break;
  }
  int val = mp._2._1;
  int outside = mp._2._2;
  //cout<<"val="<<val<<", outside="<<outside<<": "<<mp._1<<"\n";
  assert(val!=-1);

  int B[100], R[100];
  rep(i, N) B[i] = outside-1;
  for (int i : set) B[i] = val-1;
  playRound(B, R);
  if (R[a] >= val && R[b] < val) return 1;
  if (R[a] < val && R[b] >= val) return 0;
  vector<int> left, right;
  for (int i : set) {
    if (R[i] >= val) right.pb(i);
    else left.pb(i);
  }
  if (R[a] >= val) return solve3(l+left.size(), r, right, a, b);
  else return solve3(l, l+left.size()-1, left, a, b);
}

int minValue(int N, int W) {
  int B[N], R[N];
  rep(i, N) B[i] = 0;
  B[0] = 1;
  playRound(B, R);
  rep(i, N) if (R[i] <= B[i]) return i;
  abort();
}

int maxValue(int NN, int WW) {
  N = NN, W = WW;
  vector<int> left, right;
  vector<int> all;
  rep(i, N) all.pb(i);
  return solve2(1, N, all);
}

int greaterValue(int NN, int WW) {
  N = NN, W = WW;
  vector<int> left, right;
  vector<int> all;
  rep(i, N) all.pb(i);
  return solve3(1, N, all, 0, 1);
}


void allValues(int NN, int WW, int *P) {
  N = NN, W = WW;
  vector<int> left, right;
  rep(i, N) perm[i] = -1;
  vector<int> all;
  rep(i, N) all.pb(i);
  solve(1, N, all);
  rep(i, N) P[i] = perm[i];
}

Compilation message

In file included from /usr/include/c++/7/cassert:44:0,
                 from koala.cpp:13:
koala.cpp: In function 'void solve(int, int, std::vector<int>)':
koala.cpp:53:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   assert(r-l+1 == set.size());
          ~~~~~~^~~~~~~~~~~~~
koala.cpp: In function 'int solve2(int, int, std::vector<int>)':
koala.cpp:97:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   assert(r-l+1 == set.size());
          ~~~~~~^~~~~~~~~~~~~
koala.cpp:112:11: warning: unused variable 'left' [-Wunused-variable]
       int left = (r-l+1)-right;
           ^~~~
In file included from /usr/include/c++/7/cassert:44:0,
                 from koala.cpp:13:
koala.cpp: In function 'bool solve3(int, int, std::vector<int>, int, int)':
koala.cpp:136:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   assert(r-l+1 == set.size());
          ~~~~~~^~~~~~~~~~~~~

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 376 KB Output is correct
2 Correct 6 ms 388 KB Output is correct
3 Correct 7 ms 600 KB Output is correct
4 Correct 8 ms 724 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 865 ms 784 KB Output is correct
2 Correct 895 ms 816 KB Output is correct
3 Correct 891 ms 848 KB Output is correct
4 Correct 864 ms 928 KB Output is correct

Subtask #3
0 / 18.0

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

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 624 ms 944 KB Output is correct
2 Correct 550 ms 944 KB Output is correct
3 Correct 560 ms 948 KB Output is correct
4 Correct 591 ms 1024 KB Output is correct
5 Correct 693 ms 1024 KB Output is correct
6 Correct 553 ms 1052 KB Output is correct
7 Correct 571 ms 1052 KB Output is correct
8 Correct 668 ms 1052 KB Output is correct
9 Correct 575 ms 1092 KB Output is correct
10 Correct 631 ms 1096 KB Output is correct
11 Correct 819 ms 1096 KB Output is correct
12 Correct 715 ms 1096 KB Output is correct
13 Correct 733 ms 1104 KB Output is correct
14 Correct 623 ms 1104 KB Output is correct
15 Correct 659 ms 1112 KB Output is correct
16 Correct 714 ms 1112 KB Output is correct
17 Correct 666 ms 1112 KB Output is correct
18 Correct 661 ms 1248 KB Output is correct
19 Correct 633 ms 1248 KB Output is correct
20 Correct 560 ms 1248 KB Output is correct

Subtask #5
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 1248 KB Output is correct
2 Correct 41 ms 1248 KB Output is correct
3 Correct 40 ms 1248 KB Output is correct
4 Correct 37 ms 1248 KB Output is correct
5 Correct 37 ms 1248 KB Output is correct
6 Correct 37 ms 1248 KB Output is correct
7 Correct 43 ms 1248 KB Output is correct
8 Correct 44 ms 1248 KB Output is correct
9 Correct 51 ms 1248 KB Output is correct
10 Correct 56 ms 1248 KB Output is correct
11 Correct 40 ms 1248 KB Output is correct
12 Correct 41 ms 1248 KB Output is correct
13 Correct 40 ms 1248 KB Output is correct
14 Correct 37 ms 1248 KB Output is correct
15 Correct 39 ms 1248 KB Output is correct
16 Correct 38 ms 1248 KB Output is correct
17 Correct 36 ms 1248 KB Output is correct
18 Correct 44 ms 1248 KB Output is correct
19 Correct 41 ms 1248 KB Output is correct
20 Correct 45 ms 1248 KB Output is correct
21 Correct 40 ms 1248 KB Output is correct
22 Correct 39 ms 1248 KB Output is correct
23 Correct 63 ms 1248 KB Output is correct
24 Correct 39 ms 1248 KB Output is correct
25 Correct 37 ms 1248 KB Output is correct
26 Correct 47 ms 1248 KB Output is correct
27 Correct 44 ms 1248 KB Output is correct
28 Correct 36 ms 1248 KB Output is correct
29 Correct 38 ms 1248 KB Output is correct
30 Correct 36 ms 1248 KB Output is correct
31 Correct 42 ms 1248 KB Output is correct
32 Correct 39 ms 1248 KB Output is correct
33 Correct 42 ms 1248 KB Output is correct
34 Correct 39 ms 1248 KB Output is correct
35 Correct 36 ms 1248 KB Output is correct
36 Correct 41 ms 1248 KB Output is correct
37 Correct 39 ms 1248 KB Output is correct
38 Correct 39 ms 1248 KB Output is correct
39 Correct 43 ms 1248 KB Output is correct
40 Correct 43 ms 1248 KB Output is correct