oj.uz

Submission #37810

# Submission time Handle Problem Language Result Execution time Memory
37810 2017-12-28T07:03:52 Z mirbek01 Divide and conquer (IZhO14_divide) C++14
0 / 100
 1000 ms 21548 KB 
# include <bits/stdc++.h>

# define pb push_back
# define fr first
# define sc second
# define mk make_pair

using namespace std;

const int inf = 1e9 + 7;
const int N = 1e6 + 5;

typedef long long ll;

int n, a[N];
ll ans, b[N], c[N];

int main()
{
      cin >> n;

      for(int i = 1; i <= n; i ++)
      {
            cin >> a[i] >> b[i] >> c[i];
            b[i] += b[i - 1];
            c[i] += c[i - 1];
      }

      for(int i = 1; i <= n; i ++)
      {
            for(int j = 1; j < i; j ++)
            {
                  ll res = b[i] - b[j - 1], sum = c[i] - c[j - 1];
                  if(sum < a[i] - a[j]) break;
                  ans = max(ans, res);
            }
      }

      cout << ans << endl;
}

Subtask #1
0 / 17.0

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

Subtask #2
0 / 31.0

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

Subtask #3
0 / 52.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 21548 KB Output is correct
2 Correct 79 ms 21548 KB Output is correct
3 Correct 99 ms 21548 KB Output is correct
4 Execution timed out 1000 ms 21548 KB Execution timed out
5 Halted 0 ms 0 KB -