Submission #592154

#TimeUsernameProblemLanguageResultExecution timeMemory
592154nguyen31hoang08minh2003Tuna (COCI17_tuna)C++14
50 / 50
1 ms324 KiB
/* +----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+ |////| /|\ |\\\\|////| /|\ |\\\\|////| /|\ |\\\\|////| /|\ |\\\\|////| /|\ |\\\\|////| /|\ |\\\\|////| /|\ | |/// | /\|/\ | \\\|/// | /\|/\ | \\\|/// | /\|/\ | \\\|/// | /\|/\ | \\\|/// | /\|/\ | \\\|/// | /\|/\ | \\\|/// | /\|/\ | |// | /\ | /\ | \\|// | /\ | /\ | \\|// | /\ | /\ | \\|// | /\ | /\ | \\|// | /\ | /\ | \\|// | /\ | /\ | \\|// | /\ | /\ | |/ |/\ \|/ /\| \|/ |/\ \|/ /\| \|/ |/\ \|/ /\| \|/ |/\ \|/ /\| \|/ |/\ \|/ /\| \|/ |/\ \|/ /\| \|/ |/\ \|/ /\| +----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+ |\ |\/ /|\ \/| /|\ |\/ /|\ \/| /|\ |\/ /|\ \/| /|\ |\/ /|\ \/| /|\ |\/ /|\ \/| /|\ |\/ /|\ \/| /|\ |\/ /|\ \/| |\\ | \/ | \/ | //|\\ | \/ | \/ | //|\\ | \/ | \/ | //|\\ | \/ | \/ | //|\\ | \/ | \/ | //|\\ | \/ | \/ | //|\\ | \/ | \/ | |\\\ | \/|\/ | ///|\\\ | \/|\/ | ///|\\\ | \/|\/ | ///|\\\ | \/|\/ | ///|\\\ | \/|\/ | ///|\\\ | \/|\/ | ///|\\\ | \/|\/ | |\\\\| \|/ |////|\\\\| \|/ |////|\\\\| \|/ |////|\\\\| \|/ |////|\\\\| \|/ |////|\\\\| \|/ |////|\\\\| \|/ | +----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+ |////| /|\ |\\\\|////| /|\ |\\\\|////| /|\ |\\\\|////| /|\ |\\\\|////| /|\ |\\\\|////| /|\ |\\\\|////| /|\ | |/// | /\|/\ | \\\|/// | /\|/\ | \\\|/// | /\|/\ | \\\|/// | /\|/\ | \\\|/// | /\|/\ | \\\|/// | /\|/\ | \\\|/// | /\|/\ | |// | /\ | /\ | \\|// | /\ | /\ | \\|// | /\ | /\ | \\|// | /\ | /\ | \\|// | /\ | /\ | \\|// | /\ | /\ | \\|// | /\ | /\ | |/ |/\ \|/ /\| \|/ |/\ \|/ /\| \|/ |/\ \|/ /\| \|/ |/\ \|/ /\| \|/ |/\ \|/ /\| \|/ |/\ \|/ /\| \|/ |/\ \|/ /\| +----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+ |\ |\/ /|\ \/| /|\ |\/ /|\ \/| /|\ |\/ /|\ \/| /|\ |\/ /|\ \/| /|\ |\/ /|\ \/| /|\ |\/ /|\ \/| /|\ |\/ /|\ \/| |\\ | \/ | \/ | //|\\ | \/ | \/ | //|\\ | \/ | \/ | //|\\ | \/ | \/ | //|\\ | \/ | \/ | //|\\ | \/ | \/ | //|\\ | \/ | \/ | |\\\ | \/|\/ | ///|\\\ | \/|\/ | ///|\\\ | \/|\/ | ///|\\\ | \/|\/ | ///|\\\ | \/|\/ | ///|\\\ | \/|\/ | ///|\\\ | \/|\/ | |\\\\| \|/ |////|\\\\| \|/ |////|\\\\| \|/ |////|\\\\| \|/ |////|\\\\| \|/ |////|\\\\| \|/ |////|\\\\| \|/ | +----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+ */ #include <bits/stdc++.h> #define fore(i, a, b) for (int i = (a), i##_last = (b); i < i##_last; ++i) #define fort(i, a, b) for (int i = (a), i##_last = (b); i <= i##_last; ++i) #define ford(i, a, b) for (int i = (a), i##_last = (b); i >= i##_last; --i) #define fi first #define se second #define pb push_back #define sz(x) ((int)(x).size()) #define all(x) (x).begin(), (x).end() #define rall(x) (x).rbegin(), (x).rend() using namespace std; using ll = long long; using ld = long double; template<class A, class B> bool maxi(A &a, const B &b) {return (a < b) ? (a = b, true):false;}; template<class A, class B> bool mini(A &a, const B &b) {return (a > b) ? (a = b, true):false;}; typedef unsigned long long ull; typedef pair<int, int> ii; typedef vector<int> vi; typedef vector<ii> vii; typedef vector<vi> vvi; typedef vector<vii> vvii; int main() { int n, x, res = 0, p[3]; #ifdef LOCAL freopen("input.INP", "r", stdin); #endif // LOCAL cin.tie(0) -> sync_with_stdio(0); cout.tie(0); cin >> n >> x; fore(i, 0, n) { fore(j, 0, 2) cin >> p[j]; if (p[0] > p[1]) swap(p[0], p[1]); if (p[1] - p[0] <= x) res += p[1]; else { cin >> p[2]; res += p[2]; } } cout << res << '\n'; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...