結果
問題 |
No.2982 Logic Battle
|
ユーザー |
|
提出日時 | 2025-02-03 13:11:45 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 1,750 ms / 2,000 ms |
コード長 | 4,350 bytes |
コンパイル時間 | 1,883 ms |
コンパイル使用メモリ | 152,512 KB |
実行使用メモリ | 6,820 KB |
最終ジャッジ日時 | 2025-02-03 13:12:31 |
合計ジャッジ時間 | 39,273 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 38 |
コンパイルメッセージ
main.cpp: In function ‘int main()’: main.cpp:131:16: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 131 | freopen(task".inp","r",stdin); | ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ main.cpp:132:16: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 132 | freopen(task".out","w",stdout); | ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~ main.cpp:136:16: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 136 | freopen(task1".inp","r",stdin); | ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~ main.cpp:137:16: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 137 | freopen(task1".out","w",stdout); | ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
ソースコード
// #pragma GCC optimize("Ofast,unroll-loops") #include <algorithm> #include <bitset> #include <complex> #include <deque> #include <exception> #include <fstream> #include <functional> #include <iomanip> #include <ios> #include <iosfwd> #include <iostream> #include <istream> #include <iterator> #include <limits> #include <locale> #include <map> #include <new> #include <numeric> #include <ostream> #include <queue> #include <set> #include <unordered_set> #include <sstream> #include <stack> #include <stdexcept> #include <streambuf> #include <string> #include <utility> #include <valarray> #include <vector> #include <cstring> #include <unordered_map> #include <cmath> #include <array> #include <cassert> #include <random> #include <chrono> using namespace std; #define BIT(i,j) (((i)>>(j))&1LL) #define MASK(i) (1LL<<(i)) #define ALL(x) (x).begin(),(x).end() #define SZ(x) (int)(x).size() #define fi first #define se second #define ull unsigned long long #define ll long long #define ld long double #define vi vector<int> #define vvi vector<vi> #define vvvi vector<vvi> #define pii pair<int,int> #define vpii vector<pii> #define vvpii vector<vpii> #define endl "\n" #define MP make_pair #define int ll //------------------------------------------------------------------------------------------------// template<typename T1, typename T2> bool mini(T1 &a, T2 b){if(a>b){a=b;return true;}return false;} template<typename T1, typename T2> bool maxi(T1 &a, T2 b){if(a<b){a=b;return true;}return false;} template<typename T> T gcd(T a, T b) { while(b) { a %= b; swap(a,b); } return a; } template<typename T> T lcm(T a, T b) { return a/gcd(a,b)*b; } //-----------------------------------------------------------------------------------------------// const ll LINF = 1e18; const int INF = 1e9; const int LOG = 20; const int MAXN = 5e5+7; const int N = 1e2+3; const int MOD = 1e9+7; const int BASE = 1e5; const ld EPS = 1e-9; const ld PI = acos(-1); const int OFFSET = 1e3; //------------------------------------------------------------------------------------------------// int a[5003][3]; void solve(){ int n; cin >> n; for(int i = 0; i<n; i++){ for(int j = 0; j<3; j++){ cin >> a[i][j]; } } vvi dp(n+1,vi(3,-LINF)); for(int i = 0; i<3; i++) dp[0][i] = 0; for(int i = 0; i<n; i++){ vvi ndp(n+1,vi(3,-LINF)); for(int j = 0; j<=n; j++){ for(int k = 0; k<3; k++){ if(dp[j][k]==-LINF) continue; // dp[j][k] != -LINF for(int nk = 0; nk<3; nk++){ if(k==nk) continue; // k!=nk if(j==n){ maxi(ndp[j][nk],dp[j][k]+a[i][nk]*(n-i)); }else{ if(j+a[i][nk]-1>=n){ // maxi(ndp[n][nk],dp[j][k]+(j+a[i][nk]+n+1)*(j+a[i][nk]-n)/2LL); maxi(ndp[n][nk],dp[j][k]+(j+a[i][nk])*(n-i)-(n-i-1)*(n-i)/2LL); }else{ if(j+a[i][nk]-1>=0){ maxi(ndp[j+a[i][nk]-1][nk],dp[j][k]+j+a[i][nk]); }else{ maxi(ndp[0][nk],dp[j][k]); } } } } } } swap(dp,ndp); } int res = 0; for(int i = 0; i<=n; i++){ for(int j = 0; j<3; j++){ maxi(res,dp[i][j]); } } cout << res; } signed main(){ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); #define task "test" if(fopen(task".inp","r")){ freopen(task".inp","r",stdin); freopen(task".out","w",stdout); } #define task1 "nothing" if(fopen(task1".inp","r")){ freopen(task1".inp","r",stdin); freopen(task1".out","w",stdout); } int test = 1; while(test--){ solve(); } cerr << "\nTime elapsed: " << 1000*clock()/CLOCKS_PER_SEC << "ms\n"; return 0; } /** /\_/\ * (= ._.) * / >TL \>AC **/