답안 #1063077

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1063077 2024-08-17T13:58:00 Z PotatoTheWarriorFRTT Bulldozer (JOI17_bulldozer) C++14
0 / 100
1 ms 604 KB
#include <bits/stdc++.h>
using namespace std;
 
long long MOD = 1000000000+7;
typedef long long ll;
typedef pair<pair<ll, ll>, ll> Point;

int log2(int x) {
    int ln = -1;
    while(x > 0) {
        ln++;
        x/=2;
    }
    return ln;
}
 
bool comp(Point p1, Point p2) {
    return p1.first.first < p2.first.first;
}

void solve() {
    int n; cin >> n;
    vector<Point> points;
    for(int i=0;i<n;i++) {
        Point p;
        cin >> p.first.first >> p.first.second >> p.second;
        points.push_back(p);
    }
    sort(points.begin(), points.end(), comp);

    vector<ll> vals;
    for(int i=0;i<n;i++) {
        vals.push_back(0);
        ll X = points[i].first.first;
        while(points[i].first.first == X) {
            vals[vals.size()-1]+=points[i].second;
            i++;
        }
        i--;
    }
    ll S[n+1];
    ll M[n+1];
    S[0] = 0;
    M[0] = 0;
    for(int i=1;i<=n;i++) {
        S[i] = S[i-1]+vals[i-1];
        M[i] = min(M[i-1], M[i]);
    }
    ll ans = 0;
    for(int i=0;i<n;i++) {
        ans = max(ans, S[i+1] - M[i]);
    }
    cout << ans << endl;

}
 
int main()   {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    //int t;
    //cin >> t;
    //while (t--)
        solve();
    char sdhfn;
    //cin >> sdhfn;
}

Compilation message

bulldozer.cpp: In function 'int main()':
bulldozer.cpp:64:10: warning: unused variable 'sdhfn' [-Wunused-variable]
   64 |     char sdhfn;
      |          ^~~~~
# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 604 KB Output isn't correct
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 604 KB Output isn't correct
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 604 KB Output isn't correct
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -