oj.uz

답안 #70099

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
70099 2018-08-22T10:42:19 Z funcsr 코알라 (APIO17_koala) C++17
67 / 100
 914 ms 976 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 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 N, int W) {
  return 0;
}

int greaterValue(int N, int W) {
  return 0;
}


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 == k) continue;
      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 == 0) break;
    }
    if (mp._1 == 0) break;
  }
  int val = mp._2._1;
  int outside = mp._2._2;
  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);
}

void allValues(int NN, int WW, int *P) {
  N = NN, W = WW;
  if (W == 2*N) {
  }
  else {
  }

  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:71:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   assert(r-l+1 == set.size());
          ~~~~~~^~~~~~~~~~~~~

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 248 KB Output is correct
2 Correct 11 ms 484 KB Output is correct
3 Correct 7 ms 484 KB Output is correct
4 Correct 9 ms 624 KB Output is correct

Subtask #2
0 / 15.0

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

Subtask #3
0 / 18.0

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

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 862 ms 624 KB Output is correct
2 Correct 781 ms 756 KB Output is correct
3 Correct 857 ms 864 KB Output is correct
4 Correct 802 ms 864 KB Output is correct
5 Correct 768 ms 864 KB Output is correct
6 Correct 875 ms 864 KB Output is correct
7 Correct 827 ms 864 KB Output is correct
8 Correct 807 ms 864 KB Output is correct
9 Correct 827 ms 864 KB Output is correct
10 Correct 853 ms 884 KB Output is correct
11 Correct 841 ms 888 KB Output is correct
12 Correct 868 ms 892 KB Output is correct
13 Correct 835 ms 892 KB Output is correct
14 Correct 776 ms 892 KB Output is correct
15 Correct 794 ms 900 KB Output is correct
16 Correct 727 ms 900 KB Output is correct
17 Correct 817 ms 912 KB Output is correct
18 Correct 873 ms 928 KB Output is correct
19 Correct 832 ms 928 KB Output is correct
20 Correct 914 ms 928 KB Output is correct

Subtask #5
53.0 / 53.0

# 결과 실행 시간 메모리 Grader output
1 Correct 93 ms 932 KB Output is correct
2 Correct 93 ms 932 KB Output is correct
3 Correct 97 ms 932 KB Output is correct
4 Correct 97 ms 932 KB Output is correct
5 Correct 93 ms 972 KB Output is correct
6 Correct 86 ms 972 KB Output is correct
7 Correct 89 ms 972 KB Output is correct
8 Correct 87 ms 972 KB Output is correct
9 Correct 105 ms 972 KB Output is correct
10 Correct 91 ms 972 KB Output is correct
11 Correct 94 ms 972 KB Output is correct
12 Correct 110 ms 972 KB Output is correct
13 Correct 86 ms 972 KB Output is correct
14 Correct 85 ms 972 KB Output is correct
15 Correct 103 ms 976 KB Output is correct
16 Correct 89 ms 976 KB Output is correct
17 Correct 91 ms 976 KB Output is correct
18 Correct 91 ms 976 KB Output is correct
19 Correct 142 ms 976 KB Output is correct
20 Correct 105 ms 976 KB Output is correct
21 Correct 107 ms 976 KB Output is correct
22 Correct 108 ms 976 KB Output is correct
23 Correct 101 ms 976 KB Output is correct
24 Correct 103 ms 976 KB Output is correct
25 Correct 95 ms 976 KB Output is correct
26 Correct 90 ms 976 KB Output is correct
27 Correct 98 ms 976 KB Output is correct
28 Correct 99 ms 976 KB Output is correct
29 Correct 92 ms 976 KB Output is correct
30 Correct 98 ms 976 KB Output is correct
31 Correct 89 ms 976 KB Output is correct
32 Correct 89 ms 976 KB Output is correct
33 Correct 89 ms 976 KB Output is correct
34 Correct 89 ms 976 KB Output is correct
35 Correct 86 ms 976 KB Output is correct
36 Correct 104 ms 976 KB Output is correct
37 Correct 94 ms 976 KB Output is correct
38 Correct 88 ms 976 KB Output is correct
39 Correct 97 ms 976 KB Output is correct
40 Correct 103 ms 976 KB Output is correct