QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#120127	#6130. Plants vs. Zombies	hos_lyric	AC ✓	262ms	8056kb	C++14	2.6kb	2023-07-06 14:06:51	2023-07-06 14:06:52

Judging History

你现在查看的是最新测评结果

[2023-08-10 23:21:45]
System Update: QOJ starts to keep a history of the judgings of all the submissions.

[2023-07-06 14:06:52]
评测

测评结果：AC
用时：262ms
内存：8056kb

查看

[2023-07-06 14:06:51]
提交

answer

#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }


int N;
Int M;
vector<Int> A;

bool check(Int tar) {
  vector<Int> bs(N + 2, 0);
  for (int i = 1; i <= N; ++i) {
    bs[i] = (tar + A[i] - 1) / A[i];
  }
  vector<Int> cs(N + 2, 0), ds(N + 2, 0);
  vector<Int> fs(N + 2, 0), gs(N + 2, 0);
  for (int i = 1; i <= N; ++i) {
    fs[i] = fs[i - 1] + cs[i - 1];
    cs[i] = max((bs[i] - 1) - cs[i - 1], 0LL);
  }
  for (int i = N; i >= 1; --i) {
    gs[i] = gs[i + 1] + ds[i + 1];
    ds[i] = max((bs[i] - ((i == N) ? 1 : 2)) - ds[i + 1], 0LL);
  }
// cerr<<"tar = "<<tar<<", bs = "<<bs<<endl;
// cerr<<"  cs = "<<cs<<", fs = "<<fs<<endl;
// cerr<<"  ds = "<<cs<<", gs = "<<fs<<endl;
  for (int i = 1; i <= N; ++i) {
    // 0 -> N -> i
    Int cost = 0;
    cost += N;
    cost += (N - i);
    cost += 2 * fs[i - 1];
    cost += 2 * gs[i];
    cost += 2 * max(cs[i - 1], ds[i]);
    if (cost <= M) {
// cerr<<"  i = "<<i<<", cost = "<<cost<<endl;
      return true;
    }
  }
  return false;
}

int main() {
  for (int numCases; ~scanf("%d", &numCases); ) { for (int caseId = 1; caseId <= numCases; ++caseId) {
    scanf("%d%lld", &N, &M);
    A.resize(N + 1);
    for (int i = 1; i <= N; ++i) {
      scanf("%lld", &A[i]);
    }
    
    Int lo = 0;
    Int hi = M * *max_element(A.begin(), A.end()) / N + 1;
    for (; lo + 1 < hi; ) {
      const Int mid = (lo + hi) / 2;
      (check(mid) ? lo : hi) = mid;
    }
    printf("%lld\n", lo);
  }
#ifndef LOCAL
  break;
#endif
  }
  return 0;
}

源文件, 语言: C++14

详细

Test #1:

score: 100

Accepted

time: 1ms

memory: 3640kb

input:

output:

6
4

result:

ok 2 number(s): "6 4"

Test #2:

score: 0

Accepted

time: 93ms

memory: 8004kb

input:

116
4 0
3 2 6 6
4 1
3 2 6 6
10 19
10 2 8 4 2 4 9 3 3 3
4 8
3 9 3 6
2 19
2 10
11 15
3 1 1 4 3 7 10 8 6 7 10
10 14
8 7 1 1 10 9 2 8 10 7
2 13
2 3
10 10
8 1 6 6 9 4 7 1 8 8
7 14
6 7 4 5 3 1 3
11 6
8 1 10 9 7 2 6 6 1 3 9
4 10
6 1 3 8
7 7
10 6 2 10 4 7 2
5 11
9 10 5 9 2
9 1
2 4 8 6 2 8 8 1 6
4 5
7 2 9 8
...

output:

0
0
4
6
20
3
2
14
1
4
0
4
2
6
0
2
24
3
30
10
0
2
3
0
0
2
6
0
1
6
24
28
1
4
3
0
4
10
6
4
1
5
0
2
0
7
30
2
0
0
16
8
0
30
2
30
4
2
0
0
2
0
2
0
5
2
0
0
0
0
5
0
4
6
28
0
0
21
3
0
2
4
0
0
14
4
6
1
0
5
14
3
8
0
4
0
10
12
5
8
1
6
12
0
725
0
17
132
676
588
110
0
163
5910826
1000000000000
16561021906

result:

ok 116 numbers

Test #3:

score: 0

Accepted

time: 262ms

memory: 8056kb

input:

2110
4 0
3 2 6 6
4 1
3 2 6 6
2 7
3 9
28 82
68 27 32 98 88 19 96 37 53 50 45 37 41 92 51 70 73 84 2 53 7 89 9 59 24 23 62 97
22 145
61 22 87 34 75 89 22 6 10 74 21 35 33 23 85 66 89 46 16 48 2 48
25 146
67 63 93 98 1 70 57 45 40 15 1 5 54 38 96 19 94 18 43 98 28 45 47 92 46
21 26
83 54 21 72 25 47 2 ...

output:

result:

ok 2110 numbers