| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1020148 | bachhoangxuan | Portal (BOI24_portal) | C++17 | 0 ms | 0 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
// Judges with GCC >= 12 only needs Ofast
// #pragma GCC optimize("O3,no-stack-protector,fast-math,unroll-loops,tree-vectorize")
// MLE optimization
// #pragma GCC optimize("conserve-stack")
// Old judges
// #pragma GCC target("sse4.2,popcnt,lzcnt,abm,mmx,fma,bmi,bmi2")
// New judges. Test with assert(__builtin_cpu_supports("avx2"));
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
// Atcoder
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma")
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
- insert(x),erase(x)
- find_by_order(k): return iterator to the k-th smallest element
- order_of_key(x): the number of elements that are strictly smaller
*/
#include<bits/stdc++.h>
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
uniform_real_distribution<> pp(0.0,1.0);
#define int long long
#define ld long double
#define pii pair<int,int>
#define piii pair<int,pii>
#define mpp make_pair
#define fi first
#define se second
const long long inf=1e18;
const int mod=998244353;
const int maxn=200005;
const int B=650;
const int maxs=655;
const int maxm=200005;
const int maxq=1000005;
const int maxl=25;
const int maxa=1000000;
const int root=3;
int power(int a,int n){
int res=1;
while(n){
if(n&1) res=res*a%mod;
a=a*a%mod;n>>=1;
}
return res;
}
const int iroot=power(3,mod-2);
const int base=101;
int n,x[maxn],y[maxn];
void solve(){
cin >> n;
for(int i=0;i<n;i++) cin >> x[i] >> y[i];
for(int i=n-1;i>=0;i--) x[i]=abs(x[i]-x[1]),y[i]=abs(y[i]-y[1]);
vector<int> ord={0,1};
for(int i=2;i<=n;i++){
ord.push_back(i);
for(int a:ord) if(x[a] && y[a]){
for(int b:ord){
if(x[b]){
y[a]=abs(y[a]*x[b]-x[a]*y[b]);
x[a]=0;
}
else if(y[b]){
x[a]=abs(x[a]*y[b]-x[b]*y[a]);
y[a]=0;
}
break;
}
if(!x[a] && !y[a]){
ord.erase(ord.find(a));
break;
}
}
if((int)ord.size()>=3){
for(int a:ord) for(int b:ord){
if(a>=b) continue;
if(!x[a] && !x[b]){
y[a]=__gcd(y[a],y[b]);
ord.erase(ord.find(b));
}
else if(!y[a] && !y[b]){
x[a]=__gcd(x[a],x[b]);
}
}
}
}
}
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);cout.tie(NULL);
int test=1;//cin >> test;
while(test--) solve();
}