oj.uz

Submission #199932

# Submission time Handle Problem Language Result Execution time Memory
199932 2020-02-04T07:22:03 Z SamAnd Potatoes and fertilizers (LMIO19_bulves) C++17
24 / 100
 152 ms 11000 KB 
#include <bits/stdc++.h>
using namespace std;
const int N = 500005;

int n;
int a[N], b[N];
long long sa, sb;

void solv1()
{
    long long ans = 0;
    int j = 1;
    for (int i = 1; i <= n; ++i)
    {
        while (1)
        {
            if (b[j] >= a[i])
            {
                ans += abs(i - j) * 1LL * a[i];
                b[j] -= a[i];
                a[i] = 0;
                break;
            }
            else
            {
                ans += abs(i - j) * 1LL * b[j];
                a[i] -= b[j];
                b[j] = 0;
                ++j;
            }
        }
    }
    printf("%lld\n", ans);
}

int main()
{
    scanf("%d", &n);
    for (int i = 1; i <= n; ++i)
    {
        scanf("%d%d", &a[i], &b[i]);
        sa += a[i];
        sb += b[i];
    }
    if (sa == sb)
        solv1();
    return 0;
}

Compilation message

bulves.cpp: In function 'int main()':
bulves.cpp:38:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &n);
     ~~~~~^~~~~~~~~~
bulves.cpp:41:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d", &a[i], &b[i]);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 248 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 6 ms 376 KB Output is correct
4 Correct 17 ms 1016 KB Output is correct
5 Correct 27 ms 1784 KB Output is correct
6 Correct 76 ms 5752 KB Output is correct
7 Correct 152 ms 11000 KB Output is correct
8 Correct 100 ms 8952 KB Output is correct
9 Correct 118 ms 8568 KB Output is correct
10 Correct 101 ms 6136 KB Output is correct
11 Correct 103 ms 6136 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 248 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 6 ms 376 KB Output is correct
4 Correct 17 ms 1016 KB Output is correct
5 Correct 27 ms 1784 KB Output is correct
6 Correct 76 ms 5752 KB Output is correct
7 Correct 152 ms 11000 KB Output is correct
8 Correct 100 ms 8952 KB Output is correct
9 Correct 118 ms 8568 KB Output is correct
10 Correct 101 ms 6136 KB Output is correct
11 Correct 103 ms 6136 KB Output is correct
12 Incorrect 42 ms 2808 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

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

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 248 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 6 ms 376 KB Output is correct
4 Incorrect 5 ms 368 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #5
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 248 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 6 ms 376 KB Output is correct
4 Incorrect 5 ms 368 KB Output isn't correct
5 Halted 0 ms 0 KB -