oj.uz

Submission #17955

# Submission time Handle Problem Language Result Execution time Memory
17955 2016-01-13T09:28:23 Z Elibay Divide and conquer (IZhO14_divide) C++14
17 / 100
 0 ms 2892 KB 
#include <bits/stdc++.h>
using namespace std;

const int MaxN = 1e5 + 17;

int n, ind = 1, Sum, Max, Sz;

pair < int, pair < int, int > > p[MaxN];

int main ()
{
    #ifdef Elibay
        freopen (".in", "r", stdin);
    #endif
    scanf ("%d", &n);
    for (int i = 1; i <= n; ++ i)
        scanf ("%d%d%d", &p[i].first, &p[i].second.second, &p[i].second.first);
    sort (p + 1, p + n + 1);
    for (int i = 1; i <= n; ++ i)
    {
        Sz += p[i].second.first;
        int r = p[i].first;
        while (p[ind].first < r - Sz)
            Sum -= p[ind].second.second, ind ++, Sz -= p[ind].second.first;
        Sum += p[i].second.second;
        Max = max (Max, Sum);
    }
    cout << Max;
    return 0;
}

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2892 KB Output is correct
2 Correct 0 ms 2892 KB Output is correct
3 Correct 0 ms 2892 KB Output is correct
4 Correct 0 ms 2892 KB Output is correct
5 Correct 0 ms 2892 KB Output is correct
6 Correct 0 ms 2892 KB Output is correct
7 Correct 0 ms 2892 KB Output is correct
8 Correct 0 ms 2892 KB Output is correct
9 Correct 0 ms 2892 KB Output is correct
10 Correct 0 ms 2892 KB Output is correct
11 Correct 0 ms 2892 KB Output is correct
12 Correct 0 ms 2892 KB Output is correct

Subtask #2
0.0 / 31.0

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

Subtask #3
0.0 / 52.0

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