結果
問題 | No.245 貫け! |
ユーザー |
![]() |
提出日時 | 2019-02-20 16:01:32 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 8 ms / 5,000 ms |
コード長 | 2,917 bytes |
コンパイル時間 | 1,677 ms |
コンパイル使用メモリ | 169,636 KB |
実行使用メモリ | 5,248 KB |
最終ジャッジ日時 | 2024-11-06 23:05:13 |
合計ジャッジ時間 | 2,570 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 16 |
コンパイルメッセージ
main.cpp:54:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type] 54 | main(){ | ^~~~
ソースコード
#include <bits/stdc++.h>#include "unistd.h"using namespace std;#define WA cout<<"char134217728";exit(0)#define RE throw#define TLE sleep(1000)#define FOR(i,a,b) for(int i=(a),i##formax=(b);i<i##formax;i++)#define FORR(i,a,b) for(int i=(a),i##formax=(b);i>=i##formax;i--)#define pb push_back#define mp make_pair#define fi first#define se second#define pcnt __builtin_popcount#define sz(x) (int)(x).size()#define maxs(x,y) x=max(x,y)#define mins(x,y) x=min(x,y)#define show(x) cout<<#x<<" = "<<x<<endl;#define all(a) (a.begin()),(a.end())#define each(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)#define perm(c) sort(all(c));for(bool c##p=1;c##p;c##p=next_permutation(all(c)))#define uniq(v) sort(all(v));v.erase(unique(all(v)), v.end());#define bit(n) (1LL<<(n))#define randInt(l,r) (uniform_int_distribution<ll>(l,r)(rnd))#define randDouble(l,r) (uniform_real_distribution<double>(l,r)(rnd))#define dout(d) printf("%.12f\n",d)typedef long long ll;typedef __int128_t lll;typedef pair<int,int> pii;typedef pair<ll,ll> pll;template<class T>using V=vector<T>;template<class T>using VV=V<V<T>>;template<class T,class Y>ostream& operator<<(ostream& o,const pair<T,Y>& p){return o<<"("<<p.fi<<", "<<p.se<<")";}template<typename A,size_t N,typename T>void Fill(A (&array)[N],const T&v){fill((T*)array,(T*)(array+N),v);}lll gcd(lll a,lll b,lll &x,lll &y){if(!b){x=1;y=0;return a;}lll d=gcd(b,a%b,y,x);y-=a/b*x;return d;}ll gcd(ll a,ll b){lll x=0,y=0;return gcd(a,b,x,y);}ll modPow(lll a,lll n,ll m){if(!a)return a;lll p=1;for(;n>0;n>>=1,a=a*a%m)if(n&1)p=p*a%m;return(ll)p;}bool isPrime(ll n){if(n<2||n%2==0)return n==2;lll t=n-1,d=t/(t&-t);for(lll a:{2,325,9375,28178,450775,9780504,1795265022})if(a%n){for(t=d,a=modPow(a,t,n);t!=n-1&&a!=1&&a!=n-1;a=a*a%n,t=t*2%n);if(a!=n-1&&t%2==0)return 0;}return 1;}const int IINF = 1e9+6;const ll LINF = 1e18;const int MOD = 1e9+7;const double PI = acos(-1);const double EPS = 1e-10;static random_device rd;static mt19937 rnd(rd());const int N = 1e5;int n, x[N][2], y[N][2];bool cross(ll ax, ll ay, ll bx, ll by, ll cx, ll cy, ll dx, ll dy){ll tc = (ax - bx) * (cy - ay) + (ay - by) * (ax - cx);ll td = (ax - bx) * (dy - ay) + (ay - by) * (ax - dx);return tc * td <= 0;}main(){cin.tie(0);ios::sync_with_stdio(false);cin >> n;if(n==1){cout << 1 << endl;return 0;}FOR(i, 0, n)FOR(j, 0, 2)cin >> x[i][j] >> y[i][j];int ans = 0;FOR(i, 0, n*2){int _i = i/2, __i = i&1;FOR(j, 0, i){int _j = j/2, __j = j&1, c=0;if(x[_i][__i]==x[_j][__j] && y[_i][__i]==y[_j][__j]) continue;FOR(k, 0, n) if(cross(x[_i][__i],y[_i][__i],x[_j][__j],y[_j][__j],x[k][0],y[k][0],x[k][1],y[k][1])) c++;maxs(ans, c);}}cout << ans << endl;}