oj.uz

Submission #622480

# Submission time Handle Problem Language Result Execution time Memory
622480 2022-08-04T10:14:40 Z slime Uplifting Excursion (BOI22_vault) C++14
55 / 100
 5000 ms 524288 KB 
#include "bits/stdc++.h"
using namespace std;
#define int long long
const int MAXN = 3e5 + 10;
const int MOD = 1e9 + 7;
#define ll __int128
mt19937_64 rng((int)std::chrono::steady_clock::now().time_since_epoch().count());
int rnd(int x, int y) {
  int u = uniform_int_distribution<int>(x, y)(rng); return u;
}
ll read() { int x; cin >> x; return (ll)x; }
long long bm(long long b, long long p) {
  if(p==0) return 1 % MOD;
  long long r = bm(b, p >> 1);
  if(p&1) return (((r*r) % MOD) * b) % MOD;
  return (r*r) % MOD;
}
long long inv(long long b) { 
  return bm(b, MOD-2);
}
long long f[MAXN];
long long nCr(int n, int r) { 
  long long ans = f[n]; ans *= inv(f[r]); ans %= MOD;
  ans *= inv(f[n-r]); ans %= MOD; return ans;
}
long long fib[MAXN], lucas[MAXN];
void precomp() { 
  for(int i=0; i<MAXN; i++) f[i] = (i == 0 ? 1 % MOD : (f[i-1] * i) % MOD); 
  lucas[0] = 2;
  lucas[1] = 1;
  for(int i=2; i<MAXN; i++) lucas[i] = (lucas[i-2] + lucas[i-1]) % MOD;
  fib[0] = 0;
  fib[1] = 1;
  for(int i=2; i<MAXN; i++) fib[i] = (fib[i-2] + fib[i-1]) % MOD;
}
int fastlog(int x) {
  return (x == 0 ? -1 : 64 - __builtin_clzll(x) - 1);
}
void gay(int i) { cout << "Case #" << i << ": "; }
int csb(int l, int r, int k) { // count number of [l, r] such that i & 2^k > 0
  if(l > r) return 0;
  if(l == 0) {
    int s = r / (1ll << (k+1)); // number of complete cycles
    int t = r % (1ll << (k+1));
    int ans = s * (1ll << k);
    ans += (t >= (1ll << k) ? t - (1ll << k) + 1 : 0);
    return ans;
  }
  else return csb(0, r, k) - csb(0, l - 1, k);
}
int lis(vector<int> a) {
  int n = a.size();
  int bucket[n+1];
  for(int i=1; i<=n; i++) bucket[i] = 1e18;
  int ans = 1;
  for(int x: a) {
    auto it = lower_bound(bucket + 1, bucket +n +1, x);
    int d = distance(bucket, it);
    ans = max(ans, d);
    bucket[d] = min(bucket[d], x);
  }
  return ans;
}
vector<int> all_min_knapsacks(vector<int> v, int l, int r) {
  int freq[601];
  for(int i=0; i<=600; i++) freq[i] = 0;
  for(int x: v) freq[x + 300]++;
  unordered_map<int, int> dp[601];
  for(int i=0; i<=600; i++) for(int j=l; j<=r; j++) dp[i][j] = 1e18;
  for(int i=l; i<=0; i++) {
    if(i % 300 == 0 && abs(i / 300) <= freq[0]) {
      dp[0][i] = abs(i/300);
    }
  }
  for(int i=1; i<=600; i++) {
    for(int j=l; j<=r; j++) {
      dp[i][j] = dp[i-1][j];
      for(int k=1; k<=freq[i]; k++) {
        int res = j - k * (i - 300);
        if(l <= res && res <= r) dp[i][j] = min(dp[i][j], dp[i-1][res] + k);
      }
    }
  }
  vector<int> vt;
  for(int i=l; i<=r; i++) {
    if(dp[600][i] > 1e16) vt.push_back(-1);
    else vt.push_back(dp[600][i]);
  }
  return vt;
}
vector<int> all_max_knapsacks(vector<int> v, int l, int r) {
  int freq[601];
  for(int i=0; i<=600; i++) freq[i] = 0;
  for(int x: v) freq[x + 300]++;
  unordered_map<int, int> dp[601];
  for(int i=0; i<=600; i++) for(int j=l; j<=r; j++) dp[i][j] = -1e18;
  for(int i=l; i<=0; i++) {
    if(i % 300 == 0 && abs(i / 300) <= freq[0]) {
      dp[0][i] = abs(i/300);
    }
  }
  for(int i=1; i<=600; i++) {
    for(int j=l; j<=r; j++) {
      dp[i][j] = dp[i-1][j];
      for(int k=1; k<=freq[i]; k++) {
        int res = j - k * (i - 300);
        if(l <= res && res <= r) dp[i][j] = max(dp[i][j], dp[i-1][res] + k);
      }
    }
  }
  vector<int> vt;
  for(int i=l; i<=r; i++) {
    if(dp[600][i] < -1e16) vt.push_back(-1);
    else vt.push_back(dp[600][i]);
  }
  return vt;
}
void solve(int tc) {
  int m, l; cin >> m >> l;
  unordered_map<int, int> a;
  for(int i=-m; i<=m; i++) cin >> a[i];
  if(l < 0) {
    for(int i=-m; i<0; i++) swap(a[i], a[-i]);
    l = -l;
  }
  int cnt = a[0], sum = 0;
  for(int i=1; i<=m; i++) {
    int owo = (a[i] - a[-i]) * i;
    cnt += a[i] + a[-i];
    sum += owo;
  }
  if(sum == l) {
    cout << cnt << "\n"; return;
  }
  unordered_map<int, int> chosen;
  for(int i=-m; i<=m; i++) chosen[i] = a[i];
  if(sum < l) {
    for(int i=-m; i<0; i++) {
      int rem = (l - sum) / (-i);
      rem = min(rem, a[i]);
      if(sum - rem * i == l) {
        chosen[i] -= rem; 
        sum -= rem * i;
        break;
      }
      if(rem == a[i]) {
        chosen[i] = 0;
        sum -= rem * i;
      }
      else {
        rem++;
        chosen[i] -= rem;
        sum -= rem * i;
        break;
      }
    }
    if(sum < l) {
      cout << "impossible\n"; return;
    }
  }
  else {
    for(int i=m; i>0; i--) {
      int rem = (sum - l) / i;
      rem = min(rem, a[i]);
      chosen[i] -= rem;
      sum -= rem * i;
    }
  }
  if(sum == l) {
    int sm = 0;
    for(int i=-m; i<=m; i++) sm += chosen[i];
    cout << sm << "\n";
    return;
  }
  vector<int> in, out;
  for(int i=-m; i<=m; i++) {
    for(int j=0; j<min(m, chosen[i]); j++) in.push_back(i);
    for(int j=0; j<min(m, a[i] - chosen[i]); j++) out.push_back(i);
  }
  if(in.empty() || out.empty()) {
    cout << "impossible\n"; return;
  }
  int A = sum - l;
  vector<int> resin = all_min_knapsacks(in, -m*m, m*m);
  vector<int> resout = all_max_knapsacks(out, -m*m, m*m);
  int sm = 0;
  for(int i=-m; i<=m; i++) sm += chosen[i];
  int ans = -1;
  int id;
  for(int x=0; x<resout.size(); x++) {
    if(resout[x] != -1 && A + x < resin.size() && resin[A + x] != -1) {
      if(sm - resin[A + x] + resout[x] > ans) {
        ans = sm - resin[A + x] + resout[x];
        id = x;
      }
    }
  }
  cout << (ans == -1 ? "impossible" : to_string(ans)) << "\n";
} 
int32_t main() {
  precomp();
  ios::sync_with_stdio(0); cin.tie(0);
  int t = 1; //cin >> t;
  for(int i=1; i<=t; i++) solve(i);
}
// I don't know geometry.
// Teaming is unfair.

/*
5 16
0 0 0 0 0 0 0 0 3 2 1
*/

Compilation message

vault.cpp: In function 'void solve(long long int)':
vault.cpp:190:17: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  190 |   for(int x=0; x<resout.size(); x++) {
      |                ~^~~~~~~~~~~~~~
vault.cpp:191:33: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  191 |     if(resout[x] != -1 && A + x < resin.size() && resin[A + x] != -1) {
      |                           ~~~~~~^~~~~~~~~~~~~~
vault.cpp:189:7: warning: variable 'id' set but not used [-Wunused-but-set-variable]
  189 |   int id;
      |       ^~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 7636 KB Output is correct
2 Correct 12 ms 7884 KB Output is correct
3 Correct 8 ms 7352 KB Output is correct
4 Correct 8 ms 7252 KB Output is correct
5 Correct 8 ms 7372 KB Output is correct
6 Correct 1235 ms 125620 KB Output is correct
7 Correct 902 ms 125600 KB Output is correct
8 Correct 1214 ms 125620 KB Output is correct
9 Correct 1631 ms 125776 KB Output is correct
10 Correct 737 ms 125700 KB Output is correct
11 Correct 717 ms 125664 KB Output is correct

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 7636 KB Output is correct
2 Correct 12 ms 7884 KB Output is correct
3 Correct 8 ms 7352 KB Output is correct
4 Correct 8 ms 7252 KB Output is correct
5 Correct 8 ms 7372 KB Output is correct
6 Correct 1235 ms 125620 KB Output is correct
7 Correct 902 ms 125600 KB Output is correct
8 Correct 1214 ms 125620 KB Output is correct
9 Correct 1631 ms 125776 KB Output is correct
10 Correct 737 ms 125700 KB Output is correct
11 Correct 717 ms 125664 KB Output is correct
12 Correct 8 ms 7636 KB Output is correct
13 Correct 11 ms 7888 KB Output is correct
14 Correct 8 ms 7252 KB Output is correct
15 Correct 9 ms 7252 KB Output is correct
16 Correct 8 ms 7372 KB Output is correct
17 Correct 1234 ms 125636 KB Output is correct
18 Correct 893 ms 125772 KB Output is correct
19 Correct 1203 ms 125640 KB Output is correct
20 Correct 1616 ms 125704 KB Output is correct
21 Correct 720 ms 125664 KB Output is correct
22 Correct 718 ms 125712 KB Output is correct
23 Correct 8 ms 7380 KB Output is correct
24 Correct 9 ms 7296 KB Output is correct
25 Execution timed out 5090 ms 483028 KB Time limit exceeded
26 Halted 0 ms 0 KB -

Subtask #3-1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 7252 KB Output is correct
2 Correct 8 ms 7252 KB Output is correct
3 Correct 286 ms 52444 KB Output is correct
4 Correct 8 ms 7308 KB Output is correct
5 Correct 7 ms 7380 KB Output is correct
6 Correct 9 ms 7372 KB Output is correct
7 Correct 289 ms 52384 KB Output is correct
8 Correct 278 ms 52548 KB Output is correct
9 Correct 8 ms 7372 KB Output is correct
10 Correct 7 ms 7380 KB Output is correct

Subtask #3-2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 7252 KB Output is correct
2 Correct 8 ms 7252 KB Output is correct
3 Correct 286 ms 52444 KB Output is correct
4 Correct 8 ms 7308 KB Output is correct
5 Correct 7 ms 7380 KB Output is correct
6 Correct 9 ms 7372 KB Output is correct
7 Correct 289 ms 52384 KB Output is correct
8 Correct 278 ms 52548 KB Output is correct
9 Correct 8 ms 7372 KB Output is correct
10 Correct 7 ms 7380 KB Output is correct
11 Correct 9 ms 7556 KB Output is correct
12 Correct 11 ms 7884 KB Output is correct
13 Correct 8 ms 7340 KB Output is correct
14 Correct 8 ms 7252 KB Output is correct
15 Correct 8 ms 7380 KB Output is correct
16 Correct 294 ms 52392 KB Output is correct
17 Correct 8 ms 7252 KB Output is correct
18 Correct 8 ms 7380 KB Output is correct
19 Correct 8 ms 7252 KB Output is correct
20 Correct 277 ms 52440 KB Output is correct
21 Correct 289 ms 52468 KB Output is correct
22 Correct 10 ms 7252 KB Output is correct
23 Correct 8 ms 7372 KB Output is correct
24 Correct 8 ms 7380 KB Output is correct
25 Correct 315 ms 52492 KB Output is correct
26 Correct 399 ms 52460 KB Output is correct
27 Correct 8 ms 7380 KB Output is correct
28 Correct 8 ms 7336 KB Output is correct

Subtask #4-1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 7252 KB Output is correct
2 Correct 8 ms 7252 KB Output is correct
3 Correct 286 ms 52444 KB Output is correct
4 Correct 8 ms 7308 KB Output is correct
5 Correct 7 ms 7380 KB Output is correct
6 Correct 9 ms 7372 KB Output is correct
7 Correct 289 ms 52384 KB Output is correct
8 Correct 278 ms 52548 KB Output is correct
9 Correct 8 ms 7372 KB Output is correct
10 Correct 7 ms 7380 KB Output is correct
11 Correct 8 ms 7380 KB Output is correct
12 Correct 9 ms 7340 KB Output is correct
13 Correct 288 ms 52460 KB Output is correct
14 Correct 8 ms 7380 KB Output is correct
15 Correct 8 ms 7312 KB Output is correct
16 Correct 8 ms 7368 KB Output is correct
17 Correct 279 ms 52452 KB Output is correct
18 Correct 279 ms 52440 KB Output is correct
19 Correct 9 ms 7380 KB Output is correct
20 Correct 8 ms 7380 KB Output is correct
21 Correct 719 ms 125716 KB Output is correct
22 Correct 705 ms 125600 KB Output is correct
23 Correct 8 ms 7376 KB Output is correct
24 Correct 870 ms 125600 KB Output is correct
25 Correct 7 ms 7340 KB Output is correct
26 Correct 8 ms 7372 KB Output is correct
27 Correct 8 ms 7312 KB Output is correct
28 Correct 8 ms 7372 KB Output is correct

Subtask #4-2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 7636 KB Output is correct
2 Correct 12 ms 7884 KB Output is correct
3 Correct 8 ms 7352 KB Output is correct
4 Correct 8 ms 7252 KB Output is correct
5 Correct 8 ms 7372 KB Output is correct
6 Correct 1235 ms 125620 KB Output is correct
7 Correct 902 ms 125600 KB Output is correct
8 Correct 1214 ms 125620 KB Output is correct
9 Correct 1631 ms 125776 KB Output is correct
10 Correct 737 ms 125700 KB Output is correct
11 Correct 717 ms 125664 KB Output is correct
12 Correct 8 ms 7252 KB Output is correct
13 Correct 8 ms 7252 KB Output is correct
14 Correct 286 ms 52444 KB Output is correct
15 Correct 8 ms 7308 KB Output is correct
16 Correct 7 ms 7380 KB Output is correct
17 Correct 9 ms 7372 KB Output is correct
18 Correct 289 ms 52384 KB Output is correct
19 Correct 278 ms 52548 KB Output is correct
20 Correct 8 ms 7372 KB Output is correct
21 Correct 7 ms 7380 KB Output is correct
22 Correct 9 ms 7556 KB Output is correct
23 Correct 11 ms 7884 KB Output is correct
24 Correct 8 ms 7340 KB Output is correct
25 Correct 8 ms 7252 KB Output is correct
26 Correct 8 ms 7380 KB Output is correct
27 Correct 294 ms 52392 KB Output is correct
28 Correct 8 ms 7252 KB Output is correct
29 Correct 8 ms 7380 KB Output is correct
30 Correct 8 ms 7252 KB Output is correct
31 Correct 277 ms 52440 KB Output is correct
32 Correct 289 ms 52468 KB Output is correct
33 Correct 10 ms 7252 KB Output is correct
34 Correct 8 ms 7372 KB Output is correct
35 Correct 8 ms 7380 KB Output is correct
36 Correct 315 ms 52492 KB Output is correct
37 Correct 399 ms 52460 KB Output is correct
38 Correct 8 ms 7380 KB Output is correct
39 Correct 8 ms 7336 KB Output is correct
40 Correct 8 ms 7380 KB Output is correct
41 Correct 9 ms 7340 KB Output is correct
42 Correct 288 ms 52460 KB Output is correct
43 Correct 8 ms 7380 KB Output is correct
44 Correct 8 ms 7312 KB Output is correct
45 Correct 8 ms 7368 KB Output is correct
46 Correct 279 ms 52452 KB Output is correct
47 Correct 279 ms 52440 KB Output is correct
48 Correct 9 ms 7380 KB Output is correct
49 Correct 8 ms 7380 KB Output is correct
50 Correct 719 ms 125716 KB Output is correct
51 Correct 705 ms 125600 KB Output is correct
52 Correct 8 ms 7376 KB Output is correct
53 Correct 870 ms 125600 KB Output is correct
54 Correct 7 ms 7340 KB Output is correct
55 Correct 8 ms 7372 KB Output is correct
56 Correct 8 ms 7312 KB Output is correct
57 Correct 8 ms 7372 KB Output is correct
58 Correct 8 ms 7624 KB Output is correct
59 Correct 11 ms 7888 KB Output is correct
60 Correct 8 ms 7256 KB Output is correct
61 Correct 9 ms 7252 KB Output is correct
62 Correct 9 ms 7372 KB Output is correct
63 Correct 1246 ms 125740 KB Output is correct
64 Correct 974 ms 125728 KB Output is correct
65 Correct 1280 ms 125652 KB Output is correct
66 Correct 1647 ms 125732 KB Output is correct
67 Correct 740 ms 125700 KB Output is correct
68 Correct 712 ms 125608 KB Output is correct
69 Correct 8 ms 7380 KB Output is correct
70 Correct 292 ms 52444 KB Output is correct
71 Correct 8 ms 7368 KB Output is correct
72 Correct 8 ms 7252 KB Output is correct
73 Correct 8 ms 7300 KB Output is correct
74 Correct 277 ms 52436 KB Output is correct
75 Correct 279 ms 52344 KB Output is correct
76 Correct 7 ms 7380 KB Output is correct
77 Correct 8 ms 7372 KB Output is correct
78 Correct 8 ms 7380 KB Output is correct
79 Correct 314 ms 52464 KB Output is correct
80 Correct 382 ms 52464 KB Output is correct
81 Correct 7 ms 7372 KB Output is correct
82 Correct 8 ms 7380 KB Output is correct
83 Correct 11 ms 7356 KB Output is correct
84 Correct 854 ms 125604 KB Output is correct
85 Correct 9 ms 7328 KB Output is correct
86 Correct 9 ms 7380 KB Output is correct
87 Correct 9 ms 7300 KB Output is correct
88 Correct 8 ms 7380 KB Output is correct
89 Correct 1342 ms 125644 KB Output is correct
90 Correct 1620 ms 125692 KB Output is correct
91 Correct 1329 ms 125664 KB Output is correct
92 Correct 8 ms 7284 KB Output is correct

Subtask #5-1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 7252 KB Output is correct
2 Correct 8 ms 7252 KB Output is correct
3 Correct 286 ms 52444 KB Output is correct
4 Correct 8 ms 7308 KB Output is correct
5 Correct 7 ms 7380 KB Output is correct
6 Correct 9 ms 7372 KB Output is correct
7 Correct 289 ms 52384 KB Output is correct
8 Correct 278 ms 52548 KB Output is correct
9 Correct 8 ms 7372 KB Output is correct
10 Correct 7 ms 7380 KB Output is correct
11 Correct 8 ms 7380 KB Output is correct
12 Correct 9 ms 7340 KB Output is correct
13 Correct 288 ms 52460 KB Output is correct
14 Correct 8 ms 7380 KB Output is correct
15 Correct 8 ms 7312 KB Output is correct
16 Correct 8 ms 7368 KB Output is correct
17 Correct 279 ms 52452 KB Output is correct
18 Correct 279 ms 52440 KB Output is correct
19 Correct 9 ms 7380 KB Output is correct
20 Correct 8 ms 7380 KB Output is correct
21 Correct 719 ms 125716 KB Output is correct
22 Correct 705 ms 125600 KB Output is correct
23 Correct 8 ms 7376 KB Output is correct
24 Correct 870 ms 125600 KB Output is correct
25 Correct 7 ms 7340 KB Output is correct
26 Correct 8 ms 7372 KB Output is correct
27 Correct 8 ms 7312 KB Output is correct
28 Correct 8 ms 7372 KB Output is correct
29 Correct 8 ms 7372 KB Output is correct
30 Correct 8 ms 7316 KB Output is correct
31 Correct 288 ms 52444 KB Output is correct
32 Correct 7 ms 7380 KB Output is correct
33 Correct 8 ms 7252 KB Output is correct
34 Correct 8 ms 7376 KB Output is correct
35 Correct 284 ms 52504 KB Output is correct
36 Correct 275 ms 52620 KB Output is correct
37 Correct 8 ms 7328 KB Output is correct
38 Correct 8 ms 7252 KB Output is correct
39 Correct 708 ms 125588 KB Output is correct
40 Correct 706 ms 125592 KB Output is correct
41 Correct 8 ms 7380 KB Output is correct
42 Correct 845 ms 125728 KB Output is correct
43 Correct 9 ms 7252 KB Output is correct
44 Correct 10 ms 7284 KB Output is correct
45 Correct 8 ms 7252 KB Output is correct
46 Correct 7 ms 7380 KB Output is correct
47 Correct 2804 ms 482992 KB Output is correct
48 Correct 2764 ms 483084 KB Output is correct
49 Correct 9 ms 7380 KB Output is correct
50 Correct 4382 ms 483036 KB Output is correct
51 Correct 8 ms 7380 KB Output is correct
52 Correct 8 ms 7368 KB Output is correct
53 Correct 8 ms 7348 KB Output is correct
54 Correct 8 ms 7368 KB Output is correct

Subtask #5-2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 7636 KB Output is correct
2 Correct 12 ms 7884 KB Output is correct
3 Correct 8 ms 7352 KB Output is correct
4 Correct 8 ms 7252 KB Output is correct
5 Correct 8 ms 7372 KB Output is correct
6 Correct 1235 ms 125620 KB Output is correct
7 Correct 902 ms 125600 KB Output is correct
8 Correct 1214 ms 125620 KB Output is correct
9 Correct 1631 ms 125776 KB Output is correct
10 Correct 737 ms 125700 KB Output is correct
11 Correct 717 ms 125664 KB Output is correct
12 Correct 8 ms 7636 KB Output is correct
13 Correct 11 ms 7888 KB Output is correct
14 Correct 8 ms 7252 KB Output is correct
15 Correct 9 ms 7252 KB Output is correct
16 Correct 8 ms 7372 KB Output is correct
17 Correct 1234 ms 125636 KB Output is correct
18 Correct 893 ms 125772 KB Output is correct
19 Correct 1203 ms 125640 KB Output is correct
20 Correct 1616 ms 125704 KB Output is correct
21 Correct 720 ms 125664 KB Output is correct
22 Correct 718 ms 125712 KB Output is correct
23 Correct 8 ms 7380 KB Output is correct
24 Correct 9 ms 7296 KB Output is correct
25 Execution timed out 5090 ms 483028 KB Time limit exceeded
26 Halted 0 ms 0 KB -

Subtask #6-1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 7252 KB Output is correct
2 Correct 8 ms 7252 KB Output is correct
3 Correct 286 ms 52444 KB Output is correct
4 Correct 8 ms 7308 KB Output is correct
5 Correct 7 ms 7380 KB Output is correct
6 Correct 9 ms 7372 KB Output is correct
7 Correct 289 ms 52384 KB Output is correct
8 Correct 278 ms 52548 KB Output is correct
9 Correct 8 ms 7372 KB Output is correct
10 Correct 7 ms 7380 KB Output is correct
11 Correct 8 ms 7380 KB Output is correct
12 Correct 9 ms 7340 KB Output is correct
13 Correct 288 ms 52460 KB Output is correct
14 Correct 8 ms 7380 KB Output is correct
15 Correct 8 ms 7312 KB Output is correct
16 Correct 8 ms 7368 KB Output is correct
17 Correct 279 ms 52452 KB Output is correct
18 Correct 279 ms 52440 KB Output is correct
19 Correct 9 ms 7380 KB Output is correct
20 Correct 8 ms 7380 KB Output is correct
21 Correct 719 ms 125716 KB Output is correct
22 Correct 705 ms 125600 KB Output is correct
23 Correct 8 ms 7376 KB Output is correct
24 Correct 870 ms 125600 KB Output is correct
25 Correct 7 ms 7340 KB Output is correct
26 Correct 8 ms 7372 KB Output is correct
27 Correct 8 ms 7312 KB Output is correct
28 Correct 8 ms 7372 KB Output is correct
29 Correct 8 ms 7372 KB Output is correct
30 Correct 8 ms 7316 KB Output is correct
31 Correct 288 ms 52444 KB Output is correct
32 Correct 7 ms 7380 KB Output is correct
33 Correct 8 ms 7252 KB Output is correct
34 Correct 8 ms 7376 KB Output is correct
35 Correct 284 ms 52504 KB Output is correct
36 Correct 275 ms 52620 KB Output is correct
37 Correct 8 ms 7328 KB Output is correct
38 Correct 8 ms 7252 KB Output is correct
39 Correct 708 ms 125588 KB Output is correct
40 Correct 706 ms 125592 KB Output is correct
41 Correct 8 ms 7380 KB Output is correct
42 Correct 845 ms 125728 KB Output is correct
43 Correct 9 ms 7252 KB Output is correct
44 Correct 10 ms 7284 KB Output is correct
45 Correct 8 ms 7252 KB Output is correct
46 Correct 7 ms 7380 KB Output is correct
47 Correct 2804 ms 482992 KB Output is correct
48 Correct 2764 ms 483084 KB Output is correct
49 Correct 9 ms 7380 KB Output is correct
50 Correct 4382 ms 483036 KB Output is correct
51 Correct 8 ms 7380 KB Output is correct
52 Correct 8 ms 7368 KB Output is correct
53 Correct 8 ms 7348 KB Output is correct
54 Correct 8 ms 7368 KB Output is correct
55 Correct 9 ms 7252 KB Output is correct
56 Correct 8 ms 7380 KB Output is correct
57 Correct 290 ms 52440 KB Output is correct
58 Correct 7 ms 7380 KB Output is correct
59 Correct 8 ms 7304 KB Output is correct
60 Correct 7 ms 7368 KB Output is correct
61 Correct 279 ms 52588 KB Output is correct
62 Correct 277 ms 52360 KB Output is correct
63 Correct 8 ms 7380 KB Output is correct
64 Correct 8 ms 7284 KB Output is correct
65 Correct 722 ms 125592 KB Output is correct
66 Correct 703 ms 125792 KB Output is correct
67 Correct 7 ms 7380 KB Output is correct
68 Correct 833 ms 125756 KB Output is correct
69 Correct 7 ms 7252 KB Output is correct
70 Correct 7 ms 7376 KB Output is correct
71 Correct 8 ms 7252 KB Output is correct
72 Correct 7 ms 7368 KB Output is correct
73 Correct 2806 ms 483160 KB Output is correct
74 Correct 2834 ms 483108 KB Output is correct
75 Correct 9 ms 7380 KB Output is correct
76 Correct 4798 ms 483024 KB Output is correct
77 Correct 8 ms 7344 KB Output is correct
78 Correct 9 ms 7380 KB Output is correct
79 Correct 8 ms 7372 KB Output is correct
80 Correct 9 ms 7372 KB Output is correct
81 Correct 9 ms 7368 KB Output is correct
82 Runtime error 1024 ms 524288 KB Execution killed with signal 9
83 Halted 0 ms 0 KB -

Subtask #6-2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 7636 KB Output is correct
2 Correct 12 ms 7884 KB Output is correct
3 Correct 8 ms 7352 KB Output is correct
4 Correct 8 ms 7252 KB Output is correct
5 Correct 8 ms 7372 KB Output is correct
6 Correct 1235 ms 125620 KB Output is correct
7 Correct 902 ms 125600 KB Output is correct
8 Correct 1214 ms 125620 KB Output is correct
9 Correct 1631 ms 125776 KB Output is correct
10 Correct 737 ms 125700 KB Output is correct
11 Correct 717 ms 125664 KB Output is correct
12 Correct 8 ms 7636 KB Output is correct
13 Correct 11 ms 7888 KB Output is correct
14 Correct 8 ms 7252 KB Output is correct
15 Correct 9 ms 7252 KB Output is correct
16 Correct 8 ms 7372 KB Output is correct
17 Correct 1234 ms 125636 KB Output is correct
18 Correct 893 ms 125772 KB Output is correct
19 Correct 1203 ms 125640 KB Output is correct
20 Correct 1616 ms 125704 KB Output is correct
21 Correct 720 ms 125664 KB Output is correct
22 Correct 718 ms 125712 KB Output is correct
23 Correct 8 ms 7380 KB Output is correct
24 Correct 9 ms 7296 KB Output is correct
25 Execution timed out 5090 ms 483028 KB Time limit exceeded
26 Halted 0 ms 0 KB -