Submission #13152

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
13152	2015-02-01 08:34:43	woqja125	Trading (IZhO13_trading)	C++98	100 / 100	308 ms	16344 KiB

trading

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
#include<stdio.h>
#include<algorithm>
struct sales
{
  int l, r, x;
  bool operator<(const sales &A) const {return x<A.x;}
} dat[300001];
struct node
{
  node *l, *r;
  int x;
  node(){l=r=NULL; x=0;}
  void addRange(int s, int e, int f, int r, int x);
  int getx(int s, int e, int l);
};
int main()
{
  int n, m;
  int i;
  scanf("%d%d", &n, &m);
  for(i=1; i<=m; i++)
  {
    scanf("%d%d%d", &dat[i].l, &dat[i].r, &dat[i].x);
    dat[i].x -= dat[i].l;
  }
  std::sort(dat+1, dat+1+m);
  node *ST = new node();
  for(i=1; i<=m; i++)
  {
    ST->addRange(1, n, dat[i].l, dat[i].r, i);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 100 / 100