#778649 (C++17) No.2012 Largest Triangle

提出ソース

結果

問題	No.2012 Largest Triangle
ユーザー	noya2
提出日時	2022-07-15 22:28:09
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	5,279 bytes
コンパイル時間	4,367 ms
コンパイル使用メモリ	270,932 KB
実行使用メモリ	8,320 KB
最終ジャッジ日時	2024-06-27 19:08:44
合計ジャッジ時間	57,678 ms
ジャッジサーバーID （参考情報）	judge3 / judge2

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,812 KB
testcase_01	AC	2 ms 6,944 KB
testcase_02	AC	2 ms 6,940 KB
testcase_03	AC	2 ms 6,940 KB
testcase_04	AC	2 ms 6,944 KB
testcase_05	AC	2 ms 6,940 KB
testcase_06	AC	1 ms 6,940 KB
testcase_07	AC	2 ms 6,944 KB
testcase_08	AC	2 ms 6,940 KB
testcase_09	AC	2 ms 6,940 KB
testcase_10	AC	2 ms 6,940 KB
testcase_11	AC	2 ms 6,940 KB
testcase_12	AC	2 ms 6,944 KB
testcase_13	AC	2 ms 6,944 KB
testcase_14	AC	2 ms 6,944 KB
testcase_15	AC	2 ms 6,940 KB
testcase_16	WA	-
testcase_17	AC	2,454 ms 8,064 KB
testcase_18	AC	2,453 ms 8,192 KB
testcase_19	AC	2,453 ms 7,296 KB
testcase_20	AC	2,453 ms 8,320 KB
testcase_21	AC	2,454 ms 7,296 KB
testcase_22	AC	2,454 ms 8,192 KB
testcase_23	WA	-
testcase_24	WA	-
testcase_25	AC	2,453 ms 7,296 KB
testcase_26	AC	2,453 ms 8,192 KB
testcase_27	AC	2,453 ms 8,064 KB
testcase_28	AC	2,452 ms 8,192 KB
testcase_29	WA	-
testcase_30	WA	-
testcase_31	WA	-
testcase_32	WA	-
testcase_33	WA	-
testcase_34	WA	-
testcase_35	WA	-
testcase_36	AC	4 ms 6,940 KB
testcase_37	AC	4 ms 6,940 KB
testcase_38	WA	-
testcase_39	WA	-
testcase_40	WA	-
testcase_41	WA	-

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,n) for (int i = 0; i < int(n); ++i)
#define repp(i,n,m) for (int i = m; i < int(n); ++i)
#define repb(i,n) for (int i = int(n)-1; i >= 0; --i)
using namespace std;
using namespace atcoder;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using PL = pair<long long, long long>;
using pdd = pair<long double, long double>;
using pil = pair<int,ll>;
using pli = pair<ll,int>;
using ppi = pair<P,int>;
using pip = pair<int,P>;
const int INF = 1001001007;
const long long mod1 = 1000000007LL;
const long long mod2 = 998244353LL;
const ll inf = 2e18;
const ld pi = 3.14159265358979323;
const ld eps = 1e-7;
template<typename T>void o(T a);
template<class T>istream &operator>>(istream &is,vector<T> &v){for(auto &e:v)is>>e;return is;}
template<class T>istream &operator>>(istream &is,vector<vector<T>> &v){for(auto &e:v)is>>e;return is;}
template<typename T>bool range(T a,T b,T x){return (a<=x&&x<b);}
template<typename T>bool rrange(T a,T b,T c,T d,T x,T y){return (range(a,c,x)&&range(b,d,y));}
template<typename T>void rev(vector<T> &v){reverse(v.begin(),v.end());}
void revs(string &s) {reverse(s.begin(),s.end());}
template<typename T>void sor(vector<T> &v, int f=0){sort(v.begin(),v.end());if(f!=0) rev(v);}
template<typename T>bool chmin(T &a,const T &b){if(a>b){a=b;return true;}return false;}
template<typename T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<typename T>void uniq(vector<T> &v){sor(v);v.erase(unique(v.begin(),v.end()),v.end());}
template<typename T>T cel(T a,T b){return (a+b-1)/b;}
template<typename T1, typename T2>void print(pair<T1,T2> a);
template<typename T>void print(vector<T> v);
template<typename T>void print(vector<vector<T>> v);
void print(){ putchar(' '); }
void print(bool a){ printf("%d", a); }
void print(int a){ printf("%d", a); }
void print(long a){ printf("%ld", a); }
void print(long long a){ printf("%lld", a); }
void print(char a){ printf("%c", a); }
void print(char a[]){ printf("%s", a); }
void print(const char a[]){ printf("%s", a); }
void print(long double a){ printf("%.15Lf", a); }
void print(const string& a){ for(auto&& i : a) print(i); }
template<class T> void print(const T& a){ cout << a; }
int out(){ putchar('\n'); return 0; }
template<class T> int out(const T& t){ print(t); putchar('\n'); return 0; }
template<class Head, class... Tail> int out(const Head& head, const Tail&... tail){ print(head); putchar(' '); out(tail...); return 0; }
void o(){cout<<"!?"<<endl;}
template<typename T>void o(T a){cout<<a<<endl;}
template<typename T1,typename T2>void print(pair<T1,T2> a){print(a.first);print(),print(a.second);}
template<typename T>void print(vector<T> v){for(auto ite=v.begin();ite!=v.end();){print(*ite);if(++ite!=v.end())print();}}
template<typename T>void print(vector<vector<T>> v){for(auto ite=v.begin();ite!=v.end();){print(*ite);if(++ite!=v.end())out();}}
void yes(){out("Yes");}
void no (){out("No");}
void yn (bool t){if(t)yes();else no();}
template<typename T>void dame(bool t, T s){if(!t){out(s);exit(0);}}
vector<int> dx = {0,1,0,-1,1,1,-1,-1};
vector<int> dy = {1,0,-1,0,1,-1,-1,1};
const string ALP = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const string alp = "abcdefghijklmnopqrstuvwxyz";
const string NUM = "0123456789";

ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll lcm(ll a,ll b){return a/gcd(a,b)*b;}
ll mpow(ll x,ll n,ll m){if(n==0)return 1LL;x%=m;ll a=mpow(x,n/2,m);a=a*a%m;return (n&1)?a*x%m:a;}

ll op(ll a, ll b){return a + b;}
ll e(){return 0;}

struct Timer {
  chrono::high_resolution_clock::time_point st;

  Timer() { reset(); }

  void reset() {
    st = chrono::high_resolution_clock::now();
  }

  chrono::milliseconds::rep elapsed() {
    auto ed = chrono::high_resolution_clock::now();
    return chrono::duration_cast< chrono::milliseconds >(ed - st).count();
  }
};

void solve(){
    Timer tim; tim.reset();
    int n; cin >> n;
    vector<ll> xs(n), ys(n);
    rep(i,n) cin >> xs[i] >> ys[i];
    auto norm = [&](int l){
        return xs[l]*xs[l]+ys[l]*ys[l];
    };
    auto comp = [&](int l, int r){
        return xs[l]*xs[l]+ys[l]*ys[l] > xs[r]*xs[r]+ys[r]*ys[r];
    };
    vector<int> idx(n); iota(idx.begin(),idx.end(),0);
    sort(idx.begin(),idx.end(),comp);
    auto comp2 = [&](int l, int r){
        return xs[l]*ys[r] > xs[r]*ys[l];
    };
    if (norm(n-1) >= ll(1e11)){
        vector<int> jdx(n); iota(jdx.begin(),jdx.end(),0);
        sort(jdx.begin(),jdx.end(),comp2);
        ll ans = 0;
        rep(i,n-1){
            if (tim.elapsed() > 2450) break;
            int l1 = i + n/8, r1 = l1 + n/4;
            int l2 = i - n/8, r2 = l2 - n/4;
            repp(j,r1,l1){
                int k = j%n;
                chmax(ans,abs(xs[idx[i]]*ys[jdx[k]]-ys[idx[i]]*xs[jdx[k]]));
            }
            repp(j,r2,l2){
                int k = j%n;
                chmax(ans,abs(xs[idx[i]]*ys[jdx[k]]-ys[idx[i]]*xs[jdx[k]]));
            }
        }
        out(ans);
        return ;
    }
    ll ans = 0;
    rep(i,n-1){
        if (tim.elapsed() > 2450) break;
        repp(j,n,i+1){
            chmax(ans,abs(xs[idx[i]]*ys[idx[j]]-ys[idx[i]]*xs[idx[j]]));
        }
    }
    out(ans);
}

int main(){
    int t = 1; //cin >> t;
    while(t--) solve();
}

yukicoder

結果

テストケース

ソースコード