제출 #284672

#제출 시각아이디문제언어결과실행 시간메모리
284672ec1117경주 (Race) (IOI11_race)C++17
컴파일 에러
0 ms0 KiB
#include <bits/stdc++.h> #include "ricehub.h" using namespace std; typedef long long ll; typedef long double ld; typedef complex<ld> cd; typedef pair<int, int> pi; typedef pair<ll,ll> pl; typedef pair<ld,ld> pd; typedef vector<int> vi; typedef vector<ld> vd; typedef vector<ll> vl; typedef vector<pi> vpi; typedef vector<pl> vpl; typedef vector<cd> vcd; #define FOR(i, a, b) for (int i=a; i<(b); i++) #define F0R(i, a) for (int i=0; i<(a); i++) #define FORd(i,a,b) for (int i = (b)-1; i >= a; i--) #define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--) #define trav(a,x) for (auto& a : x) #define uid(a, b) uniform_int_distribution<int>(a, b)(rng) #define sz(x) (int)(x).size() #define mp make_pair #define pb push_back #define F first #define S second #define lb lower_bound #define ub upper_bound #define all(x) x.begin(), x.end() #define ins insert const int MOD = 1000000007; const char nl = '\n'; const int MX = 100001; //check the limits, dummy int besthub(int r,ll l, int x[],ll b) { int lhub=0; int p=0; int rhub=0; ll rice=0;//riceused int mx=1; while(rhub<r-1 && rice+x[rhub+1]<=b){ rhub++; rice+=x[rhub]-x[p]; } while(rhub<r){ p++; rice+=1LL*(x[p]-x[p-1])*((rhub-p)-(p-lhub)); while(rice>b){//more hubs to the left than right rice-=x[p]-x[lhub];//remove lhub lhub++; if(lhub>=p)break; } while(rhub<r-1 && rice-(x[p]-x[lhub])+(x[rhub+1]-x[p])<=b){//do i add rhub+1? rice-=x[p]-x[lhub]; lhub++; if(lhub>p)return 2; while(rhub<r-1 && rice+x[rhub+1]<=b){ rhub++; rice+=x[rhub]-x[p]; } } mx=max(mx,rhub-lhub+1); } // return mx; return mx; }

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

race.cpp:2:10: fatal error: ricehub.h: No such file or directory
    2 | #include "ricehub.h"
      |          ^~~~~~~~~~~
compilation terminated.