oj.uz

Submission #17957

# Submission time Handle Problem Language Result Execution time Memory
17957 2016-01-13T09:40:01 Z Elibay Divide and conquer (IZhO14_divide) C++14
0 / 100
 75 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)
    {
        Sum = p[i].second.second;
        Sz = p[i].second.first;
        for (int j = i + 1; j <= n; ++ j)
        {
            if (Sz + p[j].second.first >= p[j].first)
            {
                Sum += p[j].second.second;
                Sz += p[j].second.first;
            }
        }
        Max = max (Max, Sum);
    }
    cout << Max;
    return 0;
}

Subtask #1
0.0 / 17.0

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

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 20 ms 2892 KB Output is correct
2 Correct 74 ms 2892 KB Output is correct
3 Incorrect 75 ms 2892 KB Output isn't correct
4 Halted 0 ms 0 KB -