Submission #74224

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
74224	2018-08-30 13:41:57	TadijaSebez	Port Facility (JOI17_port_facility)	C++11	100 / 100	3085 ms	562856 KiB

port_facility

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 <bits/stdc++.h>
using namespace std;
#define ll long long
#define mp make_pair
#define pb push_back
const int N=2000050;
const int M=N*2;
const int mod=1e9+7;
int pos(int x){ return x<<1;}
int neg(int x){ return x<<1|1;}
struct DSU
{
  int p[M];
  void init(){ for(int i=0;i<N;i++) p[i]=i;}
  DSU(){ init();}
  int Find(int x){ return p[x]==x?x:p[x]=Find(p[x]);}
  void Union(int x, int y){ p[Find(x)]=Find(y);}
} Tree;
set<pair<int,int> > st;
int l[N],r[N],id[N];
bool comp(int i, int j){ return l[i]<l[j] || l[i]==l[j] && r[i]<r[j];}
int main()
{
  int n,i;
  scanf("%i",&n);
  for(i=1;i<=n;i++) scanf("%i %i",&l[i],&r[i]),id[i]=i;
  sort(id+1,id+1+n,comp);
  for(i=1;i<=n;i++)
  {
    int j=id[i];
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

Compilation message (stderr)

port_facility.cpp: In function 'bool comp(int, int)':
port_facility.cpp:21:57: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
 bool comp(int i, int j){ return l[i]<l[j] || l[i]==l[j] && r[i]<r[j];}
                                              ~~~~~~~~~~~^~~~~~~~~~~~
port_facility.cpp: In function 'int main()':
port_facility.cpp:25:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%i",&n);
  ~~~~~^~~~~~~~~
port_facility.cpp:26:46: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(i=1;i<=n;i++) scanf("%i %i",&l[i],&r[i]),id[i]=i;
                    ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~

• Subtask 1: 10 / 10
• Subtask 2: 12 / 12
• Subtask 3: 56 / 56
• Subtask 4: 22 / 22