## Submission #912383

# Submission time Handle Problem Language Result Execution time Memory
912383 2024-01-19T10:57:25 Z vjudge1 Potatoes and fertilizers (LMIO19_bulves) C++17
0 / 100
1000 ms 98436 KB
```#include <bits/stdc++.h>

using namespace std;

int main() {
int n;
cin >> n;
int a[n], b[n];
map <int, int> mp;
map <int, int> mp1;
map <int, int> mp2;
map <int, int> mp3;
int p = 0;
int g = 0;
int ok = 0;
int okk = 0;
long long cnt = 0;
for (int i = 0; i < n; i++) {
cin >> a[i] >> b[i];
if (a[i] > 0) {
mp2[okk] = a[i];
mp3[okk] = i;
okk++;
}
if (b[i] > 0) {
mp[ok] = b[i];
mp1[ok] = i;
ok++;
}
}
for (int j = 0; j < ok; j++) {
for (int i = g; i < okk; i++) {
if (mp[j] < mp2[i]) {
cnt += mp[j]*abs(mp1[j]-mp3[i]);
mp2[i] -= mp[j];
mp[j] = 0;
break;
}
else {
cnt += mp2[i]*abs(mp1[j]-mp3[i]);
mp[j] -= mp2[i];
mp2[i] = 0;
p++;
if (mp[j] == mp2[i]) {
break;
}
}
}
g += p;
p = 0;
}
cout << cnt;
}```

#### Subtask #1 0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 5 ms 856 KB Output is correct
4 Correct 53 ms 5488 KB Output is correct
5 Correct 94 ms 10356 KB Output is correct
6 Correct 838 ms 49488 KB Output is correct
7 Execution timed out 1030 ms 98436 KB Time limit exceeded
8 Halted 0 ms 0 KB -

#### Subtask #2 0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 5 ms 856 KB Output is correct
4 Correct 53 ms 5488 KB Output is correct
5 Correct 94 ms 10356 KB Output is correct
6 Correct 838 ms 49488 KB Output is correct
7 Execution timed out 1030 ms 98436 KB Time limit exceeded
8 Halted 0 ms 0 KB -

#### Subtask #3 0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Incorrect 1 ms 344 KB Output isn't correct
4 Halted 0 ms 0 KB -

#### Subtask #4 0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 5 ms 856 KB Output is correct
4 Incorrect 1 ms 344 KB Output isn't correct
5 Halted 0 ms 0 KB -

#### Subtask #5 0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 5 ms 856 KB Output is correct
4 Incorrect 1 ms 344 KB Output isn't correct
5 Halted 0 ms 0 KB -