hihoCoder太阁最新面经算法竞赛1 register

Ended

Participants:151

Verdict:Wrong Answer
Score:90 / 100
Submitted:2016-05-22 06:45:37

Lang:G++

Edit
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
31
#include<cstdio>
#include<cstring>
#include<iostream>
#include<cstdlib>
#include<map>
#include<queue>
#include<cmath>
#include<algorithm>
#define ll long long
#define M 1000009
using namespace std;
ll read()
{
    char ch=getchar();
    ll x=0,f=1;
    for(;ch<'0'||ch>'9';ch=getchar())
      if(ch=='-')
        f=-1;
    for(;ch>='0'&&ch<='9';ch=getchar())
      x=x*10+ch-'0';
    return x*f;
}
struct data
{
    ll x,y;
}a[M],b[M];
bool cmp(data a1,data a2)
{
    if(a1.x==a2.x)
        return a1.y<a2.y;
    return a1.x<a2.x;
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX