Submission #67002275
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
typedef unsigned uint;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<pii> vpii;
typedef complex<double> cpx;
template <typename T> using minPq = priority_queue<T, vector<T>, greater<T>>;
#define ms(a, x) memset(a, x, sizeof(a))
#define pb push_back
#define fs first
#define sn second
#define ALL(v) begin(v), end(v)
#define SZ(v) ((int) (v).size())
#define lbv(v, x) (lower_bound(ALL(v), x) - (v).begin())
#define ubv(v, x) (upper_bound(ALL(v), x) - (v).begin())
template <typename T> inline void UNIQUE(vector<T> &v){sort(ALL(v)); v.resize(unique(ALL(v)) - v.begin());}
const int INF = 0x3f3f3f3f;
const ll LLINF = 0x3f3f3f3f3f3f3f3f;
const double PI = acos(-1);
#define FR(i, n) for(int i = 0; i < (n); i++)
#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define FORR(i, a, b) for(int i = (a); i >= (b); i--)
#define dbg(x) {cerr << #x << ' ' << x << endl;}
#define dbgArr(arr, n) {cerr << #arr; FR(_i, n) cerr << ' ' << (arr)[_i]; cerr << endl;}
template <typename T, typename U>
ostream& operator<<(ostream &os, pair<T, U> p){return os << "(" << p.fs << ", " << p.sn << ")";}
int main(){
cin.sync_with_stdio(0); cin.tie(0);
int t; cin >> t;
while(t--){
int n; cin >> n;
ll f1 = 0, f2 = 0, ch = 0;
FR(i, n){
int a, b, c;
cin >> a >> b >> c;
int cf1 = max(0, min(a, b-c));
int cf2 = max(0, min(c, b-a));
f1 += cf1;
f2 += cf2;
ch += max(0, min(b-cf1-cf2, a-cf1));
}
// cerr << f1 << ' ' << f2 << ' ' << ch << endl;
if(f1 < f2){
ll d = min(f2-f1, ch);
f1 += d;
ch -= d;
}
if(f2 < f1){
ll d = min(f1-f2, ch);
f2 += d;
ch -= d;
}
cout << min(f1, f2) + ch/2 << '\n';
}
}
Submission Info
| Submission Time |
|
| Task |
A - CatCoder Double Contest |
| User |
BalintR |
| Language |
C++ 20 (gcc 12.2) |
| Score |
500 |
| Code Size |
2035 Byte |
| Status |
AC |
| Exec Time |
40 ms |
| Memory |
3536 KiB |
Judge Result
| Set Name |
Sample |
All |
| Score / Max Score |
0 / 0 |
500 / 500 |
| Status |
|
|
| Set Name |
Test Cases |
| Sample |
sample-01.txt |
| All |
01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 02-01.txt, 02-02.txt, 02-03.txt, 02-04.txt, 02-05.txt, 02-06.txt, 03-01.txt, sample-01.txt |
| Case Name |
Status |
Exec Time |
Memory |
| 01-01.txt |
AC |
40 ms |
3528 KiB |
| 01-02.txt |
AC |
32 ms |
3476 KiB |
| 01-03.txt |
AC |
30 ms |
3448 KiB |
| 01-04.txt |
AC |
30 ms |
3536 KiB |
| 01-05.txt |
AC |
31 ms |
3464 KiB |
| 02-01.txt |
AC |
31 ms |
3352 KiB |
| 02-02.txt |
AC |
32 ms |
3472 KiB |
| 02-03.txt |
AC |
31 ms |
3476 KiB |
| 02-04.txt |
AC |
28 ms |
3328 KiB |
| 02-05.txt |
AC |
28 ms |
3464 KiB |
| 02-06.txt |
AC |
29 ms |
3528 KiB |
| 03-01.txt |
AC |
30 ms |
3476 KiB |
| sample-01.txt |
AC |
1 ms |
3460 KiB |