제출 #919972

#제출 시각아이디문제언어결과실행 시간메모리
919972thunopro경주 (Race) (IOI11_race)C++14
컴파일 에러
0 ms0 KiB
#include<bits/stdc++.h> using namespace std ; #define maxn 500009 #define ll long long #define fi first #define se second #define pb push_back #define left id<<1 #define right id<<1|1 #define re exit(0); const int mod = 1e9+7; const int INF = 1e9; typedef vector<int> vi; typedef pair<int,int> pii; typedef vector<pii> vii; typedef vector<ll> vl; void add ( int &a , int b ) { a += b ; if ( a > mod ) a -= mod ; if ( a < 0 ) a += mod ; } template <typename T> void chkmin ( T &a , T b ) { if ( a > b ) a = b ; } template <typename T> void chkmax ( T &a , T b ) { if ( a < b ) a = b ; } int _pow ( int a , int n ) { if ( n == 0 ) return 1 ; int res = _pow (a,n/2) ; if ( n % 2 ) return 1ll*res*res%mod*a%mod ; else return 1ll*res*res%mod ; } void rf () { freopen ("bai1.inp","r",stdin) ; } typedef pair<ll,ll> pll ; int n ; pll a [maxn] ; ll sum [maxn] ; int main () { ios_base::sync_with_stdio(0); cin.tie(0);cout.tie(0); // rf () ; cin >> n ; for ( int i = 1 ; i <= n ; i ++ ) cin >> a[i].fi >> a[i].se ; sort (a+1,a+n+1) ; for ( int i = 1 ; i <= n ; i ++ ) sum [i] = sum [i-1] + a[i].se ; ll Min = 0 ; ll res = 0 ; for ( int i = 1 ; i <= n ; i ++ ) { chkmax (res,sum[i]-a[i].fi-Min) ; chkmin (Min,sum[i-1]-a[i].fi) ; } cout << res ; }

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

race.cpp: In function 'void rf()':
race.cpp:40:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   40 |  freopen ("bai1.inp","r",stdin) ;
      |  ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/usr/bin/ld: /tmp/ccuOnVxa.o: in function `main':
race.cpp:(.text.startup+0x0): multiple definition of `main'; /tmp/ccuZVpkb.o:grader.cpp:(.text.startup+0x0): first defined here
/usr/bin/ld: /tmp/ccuZVpkb.o: in function `main':
grader.cpp:(.text.startup+0x28): undefined reference to `best_path(int, int, int (*) [2], int*)'
collect2: error: ld returned 1 exit status