# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
951301 | hotboy2703 | Sightseeing in Kyoto (JOI22_kyoto) | C++14 | 490 ms | 26108 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using ll = long long;
using namespace std;
#define pll pair <ll,ll>
#define fi first
#define se second
#define sz(a) (ll((a).size()))
#define BIT(mask,i) (((mask) >> (i))&1)
#define MASK(i) (1LL << (i))
#define MP make_pair
const ll MAXN = 1e5;
ll n[2];
ll a[2][MAXN+100];
struct frac{
ll x,y;
bool operator < (const frac &p)const{
return (p.y * y < 0) ^ (x*p.y<p.x*y);
}
};
set <pair <frac,ll> > seg[2];
set <ll> s[2];
pair <frac,ll> cv(bool o,ll x1,ll x2){
return MP(frac({a[o][x2]-a[o][x1],x2-x1}),x2);
}
int main(){
ios_base::sync_with_stdio(0);cin.tie(nullptr);cout.tie(nullptr);
cin>>n[0]>>n[1];
for (ll j = 0;j < 2;j ++){
for (ll i = 1;i <= n[j];i ++)cin>>a[j][i];
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |