답안 #912370

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
912370 2024-01-19T10:25:29 Z vjudge1 Potatoes and fertilizers (LMIO19_bulves) C++17
0 / 100
750 ms 51536 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 && b[i] > 0) {
if (a[i] >= b[i]) {
a[i] -= b[i];
b[i] = 0;
}
else {
b[i] -= a[i];
a[i] = 0;
}
}
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++;
}
}
g += p;
p = 0;
}
cout << cnt;
}```

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 4 ms 604 KB Output is correct
4 Correct 47 ms 5432 KB Output is correct
5 Correct 96 ms 10588 KB Output is correct
6 Correct 180 ms 11752 KB Output is correct
7 Correct 662 ms 51292 KB Output is correct
8 Incorrect 750 ms 51536 KB Output isn't correct
9 Halted 0 ms 0 KB -

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 4 ms 604 KB Output is correct
4 Correct 47 ms 5432 KB Output is correct
5 Correct 96 ms 10588 KB Output is correct
6 Correct 180 ms 11752 KB Output is correct
7 Correct 662 ms 51292 KB Output is correct
8 Incorrect 750 ms 51536 KB Output isn't correct
9 Halted 0 ms 0 KB -

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 4 ms 604 KB Output is correct
4 Incorrect 0 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -