Submission #5064

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
5064	2014-01-30 21:24:16	ainta	Divide and conquer (IZhO14_divide)	C++98	100 / 100	72 ms	4992 KiB

divide

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#pragma warning(disable:4996)
#include<stdio.h>
#include<algorithm>
using namespace std;
struct A{
  long long k;
  int num;
  bool operator <(const A &p)const{
    return k != p.k ? k < p.k : num < p.num;
  }
}w[100010], w2[100010];
long long S[100010], tp, res;
int n, i;
int main()
{
  scanf("%d", &n);
  int x, g, d, pv = n;
  for (i = 1; i <= n; i++){
    scanf("%d%d%d", &x, &g, &d);
    S[i] = S[i - 1] + g;
    w2[i].k = tp - x;
    tp = tp + d;
    w[i].k = tp - x;
    w2[i].num = w[i].num = i;
  }
  sort(w + 1, w + n + 1);
  sort(w2 + 1, w2 + n + 1);
  x = 0;
  for (i = n; i >= 1; i--){
    while (pv && w[pv].k >= w2[i].k){
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 17 / 17
• Subtask 2: 31 / 31
• Subtask 3: 52 / 52