Submission #130508

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
130508	2019-07-15 12:30:38	fefe	Aliens (IOI16_aliens)	C++17	0 / 100	3 ms	376 KiB

aliens

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>
#include "aliens.h"
#define MAX_N 100005
#define fi first
#define se second
#define sq(x) ((x)*(x))
using namespace std;
typedef long long LL;
typedef pair<LL,LL> pil;
struct node{
  LL s,e;
}V[MAX_N];
LL s,e;
LL dp[MAX_N];
pil L[MAX_N];
bool is_ok(pil a,pil b,pil c){
  return (b.se-a.se)*(b.fi-c.fi)<(a.fi-b.fi)*(c.se-b.se);
}
long long take_photos(int n, int m, int k, std::vector<int> r, std::vector<int> c) {  
  LL i;
  for(i=1;i<=n;i++){
    V[i].s=min(r[i-1],c[i-1]);
    V[i].e=max(r[i-1],c[i-1]);
  }
  sort(V+1,V+n+1,[&](const node x,const node y){return (x.s==y.s)?(x.e>y.e):(x.s<y.s);});
  
  m=0;
  LL x=-1;
  for(i=1;i<=n;i++){
    if(x<V[i].e)  V[++m]=V[i];
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 0 / 4
• Subtask 2: 0 / 12
• Subtask 3: 0 / 9
• Subtask 4: 0 / 16
• Subtask 5: 0 / 19
• Subtask 6: 0 / 40