제출 #1087024

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1087024		KasymK	금 캐기 (IZhO14_divide)	C++17	48 / 100	1057 ms	2648 KiB

divide

#include "bits/stdc++.h"
using namespace std;
#define ff first
#define ss second
#define all(v) v.begin(), v.end()
#define ll long long
#define pb push_back
#define pii pair<int, int>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define tr(i, c) for(auto i = c.begin(); i != c.end(); ++i)
#define wr puts("----------------")
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
const int N = 1e5+5;
int x[N], g[N], e[N];
ll par[N], par1[N];

int main(){
    int n;
    scanf("%d", &n);
    for(int i = 1; i <= n; ++i){
        int a, b, c;
        scanf("%d%d%d", &a, &b, &c);
        x[i] = a, g[i] = b, e[i] = c;
    }
    for(int i = 1; i <= n; ++i)
        par[i] += par[i-1]+g[i], par1[i] += par1[i-1]+e[i];
    ll answer = 0;
    for(int i = 1; i <= n; ++i)
        for(int j = i+1; j <= n; ++j){
            int len = x[j]-x[i];
            // len is needed energy
            ll sm = 0, sm1 = 0;
            sm = par[j]-par[i-1], sm1 = par1[j]-par1[i-1];
            if(sm1 >= len)
                umax(answer, sm);
        }
    if(answer == 0){
        int mx = 0;
        for(int i = 1; i <= n; ++i)
            umax(mx, g[i]);
        answer = mx;
    }
    printf("%lld\n", answer);
    return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

divide.cpp: In function 'int main()':
divide.cpp:21:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   21 |     scanf("%d", &n);
      |     ~~~~~^~~~~~~~~~
divide.cpp:24:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   24 |         scanf("%d%d%d", &a, &b, &c);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 17 / 17
• Subtask 2: 31 / 31
• Subtask 3: 0 / 52