제출 #637807

#제출 시각아이디문제언어결과실행 시간메모리
637807beaconmcJob Scheduling (CEOI12_jobs)C++14
컴파일 에러
0 ms0 KiB
#include <bits/stdc++.h> #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> typedef long long ll; using namespace std; using namespace __gnu_pbds; #define FOR(i, x, y) for(ll i=x; i<y; i++) #define FORNEG(i, x, y) for(ll i=x; i>y; i--) #define ordered_set tree<ll, null_type,less_equal<ll>, rb_tree_tag,tree_order_statistics_node_update> #define fast() ios_base::sync_with_stdio(false);cin.tie(NULL) ll temp; ll n,d,m; ll lis[1000001]; vector<vector<ll>> sus(1000001); bool check(ll x){ ll cur = 0; FOR(i,0,n){ cur += lis[i]; cur -= x; if (cur >= x*d){ return false; } } return true; } void sus(ll x){ } int main(){ cin >> n >> d >> m; FOR(i,0,n){ cin >> temp; lis[temp-1] += 1; sus[temp-1].push_back(i+1); } ll lo = 0; ll hi = 1000001; while (lo<hi){ ll mid = (lo+hi)/2; if (check(mid)){ hi = mid; }else{ lo = mid+1; } } cout << lo; }

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

jobs.cpp:30:14: error: 'void sus(ll)' redeclared as different kind of entity
   30 | void sus(ll x){
      |              ^
jobs.cpp:16:20: note: previous declaration 'std::vector<std::vector<long long int> > sus'
   16 | vector<vector<ll>> sus(1000001);
      |                    ^~~