Submission #2559153
Source Code Expand
// 基本テンプレート #include <iostream> #include <iomanip> #include <cstdio> #include <string> #include <cstring> #include <deque> #include <list> #include <queue> #include <stack> #include <vector> #include <utility> #include <algorithm> #include <map> #include <set> #include <complex> #include <cmath> #include <limits> #include <cfloat> #include <climits> #include <ctime> #include <cassert> #include <numeric> #include <fstream> #include <functional> using namespace std; #define rep(i,a,n) for(int (i)=(a); (i)<(n); (i)++) #define repq(i,a,n) for(int (i)=(a); (i)<=(n); (i)++) #define repr(i,a,n) for(int (i)=(a); (i)>=(n); (i)--) #define debug(...) fprintf(stderr, __VA_ARGS__) #define int long long int template<typename T> void chmax(T &a, T b) {a = max(a, b);} template<typename T> void chmin(T &a, T b) {a = min(a, b);} template<typename T> void chadd(T &a, T b) {a = a + b;} typedef pair<int, int> pii; typedef long long ll; int dx[] = {0, 0, 1, -1}; int dy[] = {1, -1, 0, 0}; const ll INF = 1001001001001001LL; const ll MOD = 1000000007LL; int N, Q; signed main() { cin >> N >> Q; int L = 2*N; vector<int> A(L), B(L); for(int i=0; i<L; i++) cin >> A[i]; for(int i=0; i<L; i++) cin >> B[i]; int sum = 0, use = 0; set< pair<int, int> > S; for(int i=1; i<L-1; i++) { sum += max(A[i], B[i]); if(A[i] < B[i]) use ^= 1; S.insert(make_pair(abs(A[i] - B[i]), i)); } while(Q--) { int i, x, y; cin >> i >> x >> y; i--; if(i != 0 && i != L-1) { sum -= max(A[i], B[i]); if(A[i] < B[i]) use ^= 1; S.erase(make_pair(abs(A[i] - B[i]), i)); sum += max(x, y); if(x < y) use ^= 1; S.insert(make_pair(abs(x - y), i)); } A[i] = x, B[i] = y; int ans = sum + A[0] + A[L-1]; if(use) ans -= S.begin() -> first; cout << ans << endl; } return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Paired Parentheses |
User | tsutaj |
Language | C++14 (GCC 5.4.1) |
Score | 700 |
Code Size | 2042 Byte |
Status | AC |
Exec Time | 593 ms |
Memory | 17280 KB |
Judge Result
Set Name | Sample | Subtask1 | Subtask2 | All | ||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 200 / 200 | 300 / 300 | 200 / 200 | ||||||||
Status |
|
|
|
|
Set Name | Test Cases |
---|---|
Sample | 00_example_01.txt, 00_example_02.txt |
Subtask1 | 00_example_01.txt, s1_01.txt, s1_02.txt, s1_03.txt, s1_04.txt, s1_05.txt, s1_06.txt, s1_07.txt, s1_08.txt, s1_09.txt, s1_10.txt, s1_11.txt, s1_12.txt, s1_13.txt |
Subtask2 | s2_14.txt, s2_15.txt, s2_16.txt, s2_17.txt, s2_18.txt, s2_19.txt, s2_20.txt, s2_21.txt, s2_22.txt, s2_23.txt, s2_24.txt, s2_25.txt, s2_26.txt, s2_27.txt, s2_28.txt |
All | 00_example_01.txt, 00_example_02.txt, s1_01.txt, s1_02.txt, s1_03.txt, s1_04.txt, s1_05.txt, s1_06.txt, s1_07.txt, s1_08.txt, s1_09.txt, s1_10.txt, s1_11.txt, s1_12.txt, s1_13.txt, s2_14.txt, s2_15.txt, s2_16.txt, s2_17.txt, s2_18.txt, s2_19.txt, s2_20.txt, s2_21.txt, s2_22.txt, s2_23.txt, s2_24.txt, s2_25.txt, s2_26.txt, s2_27.txt, s2_28.txt, s3_29.txt, s3_30.txt, s3_31.txt, s3_32.txt, s3_33.txt, s3_34.txt, s3_35.txt, s3_36.txt, s3_37.txt, s3_38.txt, s3_39.txt, s3_40.txt, s3_41.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
00_example_01.txt | AC | 1 ms | 256 KB |
00_example_02.txt | AC | 1 ms | 256 KB |
s1_01.txt | AC | 1 ms | 256 KB |
s1_02.txt | AC | 1 ms | 256 KB |
s1_03.txt | AC | 1 ms | 256 KB |
s1_04.txt | AC | 1 ms | 256 KB |
s1_05.txt | AC | 1 ms | 256 KB |
s1_06.txt | AC | 1 ms | 256 KB |
s1_07.txt | AC | 1 ms | 256 KB |
s1_08.txt | AC | 1 ms | 256 KB |
s1_09.txt | AC | 1 ms | 256 KB |
s1_10.txt | AC | 1 ms | 256 KB |
s1_11.txt | AC | 1 ms | 256 KB |
s1_12.txt | AC | 1 ms | 256 KB |
s1_13.txt | AC | 1 ms | 256 KB |
s2_14.txt | AC | 9 ms | 896 KB |
s2_15.txt | AC | 10 ms | 1024 KB |
s2_16.txt | AC | 137 ms | 11008 KB |
s2_17.txt | AC | 110 ms | 9088 KB |
s2_18.txt | AC | 208 ms | 15872 KB |
s2_19.txt | AC | 202 ms | 15872 KB |
s2_20.txt | AC | 203 ms | 15872 KB |
s2_21.txt | AC | 204 ms | 15872 KB |
s2_22.txt | AC | 9 ms | 896 KB |
s2_23.txt | AC | 10 ms | 1024 KB |
s2_24.txt | AC | 9 ms | 896 KB |
s2_25.txt | AC | 246 ms | 15872 KB |
s2_26.txt | AC | 246 ms | 15872 KB |
s2_27.txt | AC | 245 ms | 15872 KB |
s2_28.txt | AC | 245 ms | 15872 KB |
s3_29.txt | AC | 198 ms | 8704 KB |
s3_30.txt | AC | 287 ms | 5376 KB |
s3_31.txt | AC | 172 ms | 12672 KB |
s3_32.txt | AC | 524 ms | 13568 KB |
s3_33.txt | AC | 205 ms | 8704 KB |
s3_34.txt | AC | 593 ms | 17280 KB |
s3_35.txt | AC | 588 ms | 17280 KB |
s3_36.txt | AC | 569 ms | 17280 KB |
s3_37.txt | AC | 564 ms | 17280 KB |
s3_38.txt | AC | 578 ms | 17280 KB |
s3_39.txt | AC | 567 ms | 17280 KB |
s3_40.txt | AC | 238 ms | 1024 KB |
s3_41.txt | AC | 236 ms | 1024 KB |