結果
問題 | No.2196 Pair Bonus |
ユーザー |
![]() |
提出日時 | 2023-12-14 21:05:37 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 243 ms / 2,000 ms |
コード長 | 1,995 bytes |
コンパイル時間 | 3,711 ms |
コンパイル使用メモリ | 251,376 KB |
最終ジャッジ日時 | 2025-02-18 10:57:00 |
ジャッジサーバーID (参考情報) |
judge3 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 15 |
ソースコード
#include <bits/stdc++.h>#include <atcoder/all>#define OVERLOAD_REP(_1, _2, _3, name, ...) name#define REP1(i,n) for (auto i = std::decay_t<decltype(n)>{}; (i) != (n); ++(i))#define REP2(i,l,r) for (auto i = (l); (i) != (r); ++(i))#define rep(...) OVERLOAD_REP(__VA_ARGS__, REP2, REP1)(__VA_ARGS__)#define all(a) (a).begin(),(a).end()#define rall(a) (a).rbegin(),(a).rend()using namespace std;using namespace atcoder;using ll = long long;using ull = unsigned long long;using P = pair<int,int>;using LP = pair<long long,long long>;using SP = pair<string,string>;using vi = vector<int>;using vl = vector<long long>;using vs = vector<string>;using vc = vector<char>;using mint1 = modint1000000007;using mint9 = modint998244353;const int INF = 2e9;const long long LINF = 4e18;const int di[] = {0,1,0,-1,-1,1,-1,1};const int dj[] = {1,0,-1,0,1,1,-1,-1};template<class T> inline bool chmin(T& a, T b){if(a>b){a=b;return true;}return false;}template<class T> inline bool chmax(T& a, T b){if(a<b){a=b;return true;}return false;}void YesNo (bool ok , const string &s , const string &t) {if(ok) cout << s << endl; else cout << t << endl;}//-----def end-----//int main () {int n;cin >> n;int n2 = n*2;vector<long long> a(n2) , b(n2) , x(n) , y(n);rep(i , n2) cin >> a[i];rep(i , n2) cin >> b[i];rep(i , n) cin >> x[i];rep(i , n) cin >> y[i];long long res = 0;rep(i , n) {long long p = -LINF;{//RRlong long now = a[2*i]+a[2*i+1]+x[i];chmax(p , now);}{//RBlong long now = a[2*i]+b[2*i+1]+y[i];chmax(p , now);}{//BRlong long now = b[2*i]+a[2*i+1]+y[i];chmax(p , now);}{//RRlong long now = b[2*i]+b[2*i+1]+x[i];chmax(p , now);}res += p;}cout << res << endl;return 0;}