# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
599437 | 2022-07-19T14:09:01 Z | DrollWolf | Tuna (COCI17_tuna) | C++17 | 1 ms | 300 KB |
#include <bits/stdc++.h> using namespace std; typedef long long int lli; //const int N = 2*(10e5+7); //int arr[N]; int main() { lli t, n, c, a, b, ans, i, x; char ch; ans=0; cin>>n>>x; string str; while(n--) { cin>>a>>b; if(abs(a-b)<=x) ans+=max(a, b); else { cin>>c; ans+=c; } } cout<<ans<<'\n'; //freopen("diamond.in","r",stdin); //freopen("diamond.out","w",stdout); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Correct | 1 ms | 212 KB | Output is correct |
3 | Correct | 1 ms | 212 KB | Output is correct |
4 | Correct | 1 ms | 212 KB | Output is correct |
5 | Correct | 1 ms | 212 KB | Output is correct |
6 | Correct | 1 ms | 212 KB | Output is correct |
7 | Correct | 1 ms | 300 KB | Output is correct |
8 | Correct | 1 ms | 212 KB | Output is correct |
9 | Correct | 1 ms | 300 KB | Output is correct |
10 | Correct | 1 ms | 300 KB | Output is correct |