oj.uz

답안 #941525

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
941525 2024-03-09T05:03:43 Z ifateen Bulldozer (JOI17_bulldozer) C++14
5 / 100
 1 ms 452 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
vector<int> posx, posy;

int compress(int x, bool X) {
    if (X) return lower_bound(begin(posx), end(posx), x) - begin(posx);
    return lower_bound(begin(posy), end(posy), x) - begin(posy);
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int q;
    cin >> q;
    vector<vector<int>> info;
    vector<int> prefx(q), prefy(q);
    while (q--) {
        int x, y, v;
        cin >> x >> y >> v;
        posx.push_back(x);
        posy.push_back(y);
        info.push_back({x, y, v});
    }
    sort(begin(posx), end(posx));
    posx.erase(unique(begin(posx), end(posx)), end(posx));

    for (auto& i : info) {
        prefx[compress(i[0], true)] += i[2];
    }
    int sm = 0, mn = 0, ans = 0;
    for (int i = 0; i < posx.size(); i++) {
        sm += prefx[i];
        mn = min(mn, sm);
        ans = max(ans, sm - mn);
    }
    cout << ans;
}

Compilation message

bulldozer.cpp: In function 'int main()':
bulldozer.cpp:32:23: 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]
   32 |     for (int i = 0; i < posx.size(); i++) {
      |                     ~~^~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 452 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 452 KB Output is correct

Subtask #2
0 / 20.0

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

Subtask #3
0 / 35.0

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

Subtask #4
0 / 20.0

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

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 452 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 452 KB Output is correct
16 Incorrect 1 ms 348 KB Output isn't correct
17 Halted 0 ms 0 KB -