oj.uz

Submission #1063509

# Submission time Handle Problem Language Result Execution time Memory
1063509 2024-08-17T19:41:02 Z medmdg Bulldozer (JOI17_bulldozer) C++14
5 / 100
 40 ms 452 KB 
/******************************************************************************

                              Online C++ Compiler.
               Code, Compile, Run and Debug C++ program online.
Write your code in this editor and press "Run" button to compile and execute it.

*******************************************************************************/

#include <bits/stdc++.h>
#define pb(a) push_back(a)
using namespace std;
typedef long long ll;

 
ll max_sub_sum(vector<ll> &vals) {
    ll S[vals.size()+1];
    ll M[vals.size()+1];
    S[0] = 0;
    M[0] = 0;
    for(int i=1;i<=vals.size();i++) {
        S[i] = S[i-1]+vals[i-1];
        M[i] = min(M[i-1], S[i]);
    }
    ll ans = 0;
    for(int i=0;i<vals.size();i++) {
        ans = max(ans, S[i+1] - M[i+1]);
    }
    return ans;
}

void solve(){
    ll n;
    cin>>n;
    vector<vector<ll>> points(n);
    for(int i=0;i<n;i++){
        ll x,y,w;
        cin>>x>>y>>w;
        points[i]={x,y,w};
    }
    sort(points.begin(),points.end());
    vector<vector<ll>> temp;
    temp.pb(points[0]);
    ll ans=0;
    for(int i=1;i<n;i++){
        if(points[i][0]==points[i-1][0]&& points[i][1]==points[i-1][1]){
            temp.back()[2]+=points[i][2];
        }else temp.pb(points[i]);
    }
    points=temp;
    n=points.size();
    for(auto i:points)ans=max(ans,i[2]);
    
    for(int i=0;i<n;i++){
        for(int j=i+1;j<n;j++){
            ll derive[2]={points[i][0]-points[j][0],points[i][1]-points[j][1]};
            vector<vector<ll> > t(n);
            for(int k=0;k<n;k++){
                if(derive[0]==0){
                    t[k]={points[k][1],points[k][2]};
                }else{
                    t[k]={points[k][0]*derive[0]+points[k][1]*derive[1],points[k][2]};
                }
            }
            sort(t.begin(),t.end());
            vector<ll>vals;
            for(int k=0;k<n;k++) {
                vals.push_back(t[k][1]);
                ll X = t[k][0];
                k++;
                while(k<n && points[k][0] == X) {
                    vals.back()+=t[k][1];
                    k++;
                }
                k--;
            }
            ans = max(ans, max_sub_sum(vals));
        }
    }
    cout<<ans<<endl;
}
int main()
{
    solve();

    return 0;
}

Compilation message

bulldozer.cpp: In function 'll max_sub_sum(std::vector<long long int>&)':
bulldozer.cpp:20:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   20 |     for(int i=1;i<=vals.size();i++) {
      |                 ~^~~~~~~~~~~~~
bulldozer.cpp:25:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   25 |     for(int i=0;i<vals.size();i++) {
      |                 ~^~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 344 KB Output is correct
2 Correct 28 ms 348 KB Output is correct
3 Correct 27 ms 348 KB Output is correct
4 Correct 27 ms 348 KB Output is correct
5 Correct 27 ms 448 KB Output is correct
6 Correct 28 ms 348 KB Output is correct
7 Correct 27 ms 452 KB Output is correct
8 Correct 27 ms 348 KB Output is correct
9 Correct 27 ms 344 KB Output is correct
10 Correct 27 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 348 KB Output is correct
2 Correct 40 ms 344 KB Output is correct
3 Correct 38 ms 348 KB Output is correct
4 Correct 39 ms 348 KB Output is correct
5 Correct 39 ms 348 KB Output is correct
6 Correct 39 ms 348 KB Output is correct
7 Correct 39 ms 348 KB Output is correct
8 Incorrect 39 ms 344 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #3
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 348 KB Output is correct
2 Correct 40 ms 344 KB Output is correct
3 Correct 38 ms 348 KB Output is correct
4 Correct 39 ms 348 KB Output is correct
5 Correct 39 ms 348 KB Output is correct
6 Correct 39 ms 348 KB Output is correct
7 Correct 39 ms 348 KB Output is correct
8 Incorrect 39 ms 344 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 348 KB Output is correct
2 Correct 40 ms 344 KB Output is correct
3 Correct 38 ms 348 KB Output is correct
4 Correct 39 ms 348 KB Output is correct
5 Correct 39 ms 348 KB Output is correct
6 Correct 39 ms 348 KB Output is correct
7 Correct 39 ms 348 KB Output is correct
8 Incorrect 39 ms 344 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 344 KB Output is correct
2 Correct 28 ms 348 KB Output is correct
3 Correct 27 ms 348 KB Output is correct
4 Correct 27 ms 348 KB Output is correct
5 Correct 27 ms 448 KB Output is correct
6 Correct 28 ms 348 KB Output is correct
7 Correct 27 ms 452 KB Output is correct
8 Correct 27 ms 348 KB Output is correct
9 Correct 27 ms 344 KB Output is correct
10 Correct 27 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 39 ms 348 KB Output is correct
17 Correct 40 ms 344 KB Output is correct
18 Correct 38 ms 348 KB Output is correct
19 Correct 39 ms 348 KB Output is correct
20 Correct 39 ms 348 KB Output is correct
21 Correct 39 ms 348 KB Output is correct
22 Correct 39 ms 348 KB Output is correct
23 Incorrect 39 ms 344 KB Output isn't correct
24 Halted 0 ms 0 KB -