// #pragma GCC optimize("Ofast,unroll-loops") #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include 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 #define vvi vector #define vvvi vector #define pii pair #define vpii vector #define vvpii vector #define endl "\n" #define MP make_pair #define int ll //------------------------------------------------------------------------------------------------// template bool mini(T1 &a, T2 b){if(a>b){a=b;return true;}return false;} template bool maxi(T1 &a, T2 b){if(a T gcd(T a, T b) { while(b) { a %= b; swap(a,b); } return a; } template 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 calc(int n, int i){ assert(i>=1); if(i>=n) return 1LL*n*(n+1)/2; return 1LL*(n+(n-i+1))*i/2; } pii dp[5003][4]; int a[5003][4]; void solve(){ int n; cin >> n; for(int i = 1; i<=n; i++){ for(int j = 1; j<=3; j++){ cin >> a[i][j]; } } for(int j = 1; j<=3; j++) dp[1][j] = MP(a[1][j],max(0LL,a[1][j]-1)); for(int i = 1; iTL \>AC **/