結果
問題 | No.1726 [Cherry 3rd Tune B] ジャマイカビアポン |
ユーザー | kiyoshi0205 |
提出日時 | 2021-10-29 22:30:44 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 2,465 ms / 3,000 ms |
コード長 | 3,614 bytes |
コンパイル時間 | 2,621 ms |
コンパイル使用メモリ | 187,088 KB |
実行使用メモリ | 43,652 KB |
最終ジャッジ日時 | 2023-08-19 11:33:55 |
合計ジャッジ時間 | 37,272 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge10 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
4,380 KB |
testcase_01 | AC | 2 ms
4,384 KB |
testcase_02 | AC | 1 ms
4,384 KB |
testcase_03 | AC | 1 ms
4,384 KB |
testcase_04 | AC | 3 ms
4,380 KB |
testcase_05 | AC | 4 ms
4,384 KB |
testcase_06 | AC | 2 ms
4,380 KB |
testcase_07 | AC | 2 ms
4,380 KB |
testcase_08 | AC | 2 ms
4,380 KB |
testcase_09 | AC | 2 ms
4,380 KB |
testcase_10 | AC | 3 ms
4,380 KB |
testcase_11 | AC | 4 ms
4,384 KB |
testcase_12 | AC | 8 ms
4,384 KB |
testcase_13 | AC | 2 ms
4,380 KB |
testcase_14 | AC | 261 ms
12,136 KB |
testcase_15 | AC | 1,052 ms
26,780 KB |
testcase_16 | AC | 1,684 ms
35,028 KB |
testcase_17 | AC | 1,035 ms
26,068 KB |
testcase_18 | AC | 758 ms
21,868 KB |
testcase_19 | AC | 1,401 ms
31,656 KB |
testcase_20 | AC | 311 ms
13,604 KB |
testcase_21 | AC | 1,299 ms
30,076 KB |
testcase_22 | AC | 510 ms
17,576 KB |
testcase_23 | AC | 564 ms
18,352 KB |
testcase_24 | AC | 2,175 ms
43,484 KB |
testcase_25 | AC | 2,286 ms
43,392 KB |
testcase_26 | AC | 2,243 ms
43,412 KB |
testcase_27 | AC | 2,465 ms
43,528 KB |
testcase_28 | AC | 2,339 ms
43,472 KB |
testcase_29 | AC | 2,267 ms
43,472 KB |
testcase_30 | AC | 2,314 ms
43,412 KB |
testcase_31 | AC | 2,326 ms
43,596 KB |
testcase_32 | AC | 2,355 ms
43,364 KB |
testcase_33 | AC | 2,215 ms
43,652 KB |
testcase_34 | AC | 2 ms
4,384 KB |
testcase_35 | AC | 2 ms
4,380 KB |
testcase_36 | AC | 1 ms
4,380 KB |
testcase_37 | AC | 1 ms
4,384 KB |
testcase_38 | AC | 144 ms
4,384 KB |
ソースコード
#pragma GCC target("avx") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #include<bits/stdc++.h> // #include<ext/pb_ds/assoc_container.hpp> // #include<ext/pb_ds/tree_policy.hpp> // #include<ext/pb_ds/tag_and_trait.hpp> // using namespace __gnu_pbds; // #include<boost/multiprecision/cpp_int.hpp> // namespace multiprecisioninteger = boost::multiprecision; // using cint=multiprecisioninteger::cpp_int; using namespace std; using ll=long long; using datas=pair<ll,ll>; using ddatas=pair<long double,long double>; using tdata=pair<ll,datas>; using vec=vector<ll>; using mat=vector<vec>; using pvec=vector<datas>; using pmat=vector<pvec>; // using llset=tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>; #define For(i,a,b) for(i=a;i<(ll)b;++i) #define bFor(i,b,a) for(i=b,--i;i>=(ll)a;--i) #define rep(i,N) For(i,0,N) #define rep1(i,N) For(i,1,N) #define brep(i,N) bFor(i,N,0) #define brep1(i,N) bFor(i,N,1) #define all(v) (v).begin(),(v).end() #define allr(v) (v).rbegin(),(v).rend() #define vsort(v) sort(all(v)) #define vrsort(v) sort(allr(v)) #define uniq(v) vsort(v),(v).erase(unique(all(v)),(v).end()) #define endl "\n" #define popcount __builtin_popcountll #define eb emplace_back #define print(x) cout<<x<<endl #define printyes print("Yes") #define printno print("No") #define printYES print("YES") #define printNO print("NO") #define output(v) do{bool f=0;for(auto outi:v){cout<<(f?" ":"")<<outi;f=1;}cout<<endl;}while(0) #define matoutput(v) do{for(auto outimat:v)output(outimat);}while(0) constexpr ll mod=1000000007; // constexpr ll mod=998244353; constexpr ll inf=1LL<<60; constexpr long double eps=1e-9; const long double PI=acosl(-1); template<class T,class E> ostream& operator<<(ostream& os,const pair<T,E>& p){return os<<"("<<p.first<<","<<p.second<<")";} template<class T> ostream& operator<<(ostream& os,const vector<T>& v){ os<<"{";bool f=false; for(auto& x:v){if(f)os<<",";os<<x;f=true;} os<<"}"; return os; } template<class T> ostream& operator<<(ostream& os,const set<T>& v){ os<<"{";bool f=false; for(auto& x:v){if(f)os<<",";os<<x;f=true;} os<<"}"; return os; } template<class T> ostream& operator<<(ostream& os,const multiset<T>& v){ os<<"{";bool f=false; for(auto& x:v){if(f)os<<",";os<<x;f=true;} os<<"}"; return os; } template<class T,class E> ostream& operator<<(ostream& os,const map<T,E>& v){ os<<"{";bool f=false; for(auto& x:v){if(f)os<<",";os<<x;f=true;} os<<"}"; return os; } template<class T> inline bool chmax(T& a,const T b){bool x=a<b;if(x)a=b;return x;} template<class T> inline bool chmin(T& a,const T b){bool x=a>b;if(x)a=b;return x;} #ifdef DEBUG void debugg(){cout<<endl;} template<class T,class... Args>void debugg(const T& x,const Args&... args){cout<<" "<<x;debugg(args...);} #define debug(...) cout<<__LINE__<<" ["<<#__VA_ARGS__<<"]:",debugg(__VA_ARGS__) #else #define debug(...) (void(0)) #endif inline void startupcpp(void) noexcept{ cin.tie(0); ios::sync_with_stdio(false); cout<<fixed<<setprecision(15); } int N,M; int p[800],a[800],b[800],c[800],d[800]; ll calc(){ map<pair<int,int>,ll> mp; for(int i=0;i<N;++i)for(int j=0;j<M;++j){ mp[pair<int,int>(a[i]-c[j],b[i]-d[j])]+=p[i]; } ll ans=-inf; for(auto x:mp)chmax(ans,x.second); return ans; } int main(){ startupcpp(); cin>>N>>M; for(int i=0;i<N;++i)cin>>p[i]; for(int i=0;i<N;++i)cin>>a[i]>>b[i]; for(int i=0;i<M;++i)cin>>c[i]>>d[i]; auto ans=calc(); for(auto&x:c)x=-x; chmax(ans,calc()); for(auto&x:d)x=-x; chmax(ans,calc()); for(auto&x:c)x=-x; chmax(ans,calc()); print(max(ans,0LL)); }