QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#496943	#6130. Plants vs. Zombies	ucup-team1198^#	AC ✓	518ms	4952kb	C++20	1.5kb	2024-07-28 17:07:09	2024-07-28 17:07:11

Judging History

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

[2024-07-28 17:07:11]
评测

测评结果：AC
用时：518ms
内存：4952kb

查看

[2024-07-28 17:07:09]
提交

answer

#include <map>
#include <set>
#include <array>
#include <cmath>
#include <deque>
#include <bitset>
#include <random>
#include <string>
#include <vector>
#include <cassert>
#include <complex>
#include <iomanip>
#include <iostream>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>

using namespace std;

void solve() {
  int n;
  long long m;
  cin >> n >> m;
  vector<long long> A(n);
  for (int i = 0; i < n; ++i)
    cin >> A[i];
  long long left = 0, right = 1e18;
  while (right - left > 1) {
    long long mid = (left + right) / 2;
    bool ok = false;
    for (int _ = 0; _ < 2; ++_) {
      vector<long long> need(n);
      for (int i = 0; i < n; ++i)
        need[i] = (mid + A[i] - 1) / A[i];
      long long m_rest = m - n;
      for (int i = 0; i < n; ++i)
        --need[i];
      if (_ == 1) {
        --need[n - 2];
        --m_rest;
      }
      for (int i = 0; m_rest >= 0 && i + 1 < n; ++i) {
        if (need[i] >= 0) {
          m_rest -= 2 * need[i];
          need[i + 1] -= need[i];
        }
      }
      if (need[n - 1] >= 0 && m_rest >= 0) {
        m_rest -= 2 * need[n - 1];
      }
      if (m_rest >= 0)
        ok = true;
    }
    if (ok)
      left = mid;
    else
      right = mid;
  }
  cout << left << '\n';
}

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  
  int t;
  cin >> t;
  while (t--) {
    solve();
  }
  return 0;
}

源文件, 语言: C++20

詳細信息

Test #1:

score: 100

Accepted

time: 0ms

memory: 3620kb

input:

output:

6
4

result:

ok 2 number(s): "6 4"

Test #2:

score: 0

Accepted

time: 197ms

memory: 4952kb

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: 518ms

memory: 4744kb

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