# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
198704 | SamAnd | Garage (IOI09_garage) | C++17 | 7 ms | 376 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
const int N = 102, M = 2003;
int n, m;
int r[N], w[M];
int u[M];
int main()
{
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; ++i)
scanf("%d", &r[i]);
for (int i = 1; i <= m; ++i)
scanf("%d", &w[i]);
int ans = 0;
queue<int> q;
set<int> s;
for (int i = 1; i <= n; ++i)
s.insert(i);
for (int ii = 0; ii < m * 2; ++ii)
{
int i;
scanf("%d", &i);
if (i > 0)
{
if (!s.empty())
{
u[i] = (*s.begin());
s.erase(u[i]);
ans += w[i] * r[u[i]];
}
else
q.push(i);
}
else
{
i *= -1;
s.insert(u[i]);
while (!q.empty() && !s.empty())
{
int i = q.front();
q.pop();
u[i] = (*s.begin());
s.erase(u[i]);
ans += w[i]* r[u[i]];
}
}
}
printf("%d\n", ans);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |