Submission #480161

#TimeUsernameProblemLanguageResultExecution timeMemory
480161gg123_peGarage (IOI09_garage)C++17
0 / 100
7 ms460 KiB
#include <bits/stdc++.h> using namespace std; #define f(i,a,b) for(int i = a; i < b; i++) int n, m, x, ans, rate[105], w[2005], place[2005], freee; bool on[105]; int main(){ cin >> n >> m; f(i,1,n+1) cin >> rate[i]; f(i,1,m+1) cin >> w[i]; freee = n; queue <int> q; f(i,0,2*m){ cin >> x; if(x < 0){ on[place[-x]] = 0, freee++; if(q.size() == 0) continue; int t = q.front(); f(j,1,n+1){ if(!on[j]) { place[x] = j, on[j] = 1, ans += rate[j]*w[t]; cout << "car " << t << " place " << j << endl; break; } } q.pop(), freee--; continue; } else{ q.push(x); while(!q.empty()){ if(freee == 0) break; int t = q.front(); f(j,1,n+1){ if(!on[j]) { place[x] = j, on[j] = 1, ans += rate[j]*w[t]; cout << "car " << t << " place " << j << endl; break; } } q.pop(), freee--; } } } cout << ans << endl; return 0; }

Compilation message (stderr)

garage.cpp: In function 'int main()':
garage.cpp:25:28: warning: array subscript -1 is below array bounds of 'int [2005]' [-Warray-bounds]
   25 |                     place[x] = j, on[j] = 1, ans += rate[j]*w[t];
      |                     ~~~~~~~^
garage.cpp:6:39: note: while referencing 'place'
    6 | int n, m, x, ans, rate[105], w[2005], place[2005], freee;
      |                                       ^~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...