Submission #640924

#TimeUsernameProblemLanguageResultExecution timeMemory
640924Chal1shkanLjeto (COCI21_ljeto)C++14
50 / 50
1 ms324 KiB
# include <bits/stdc++.h> # include <ext/pb_ds/assoc_container.hpp> # include <ext/pb_ds/tree_policy.hpp> # define mkp make_pair # define ff first # define ss second # define pll pair <ll, ll> # define pii pair <int, int> # define vec vector # define pb push_back # define pf push_front # define ppb pop_back # define ppf pop_front # define all(x) (x).begin(), (x).end() # define rall(x) (x).rbegin(), (x).rend() # define sz(x) ((int)(x).size()) # define lb lower_bound # define ub upper_bound # define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update> # define br break # define rt return # define cn continue # define nl "\n" # define off exit(0) typedef long long ll; typedef unsigned long long ull; typedef long double ld; const ll MAXN = 1e5 + 25; const ll MAXL = 18 + 0; const ll INF1 = 1e18 + 0; const ll INF2 = 2e9 + 0; const ll MOD = 1e9 + 7; const ll M0D = 998244353; const ld PI = acos((ld) -1); const ll P = 67 + 0 + 0; using namespace std; using namespace __gnu_pbds; void qataima () { ios::sync_with_stdio(false); cin.tie(0); //freopen ("file.in", "r", stdin); //freopen ("file.out", "w", stdout); } void ma1n () { int n; cin >> n; pair < int, pii > a[n + 3]; int x[15] = {0}; for (int i = 1; i <= n; ++i) { cin >> a[i].ff >> a[i].ss.ff >> a[i].ss.ss; } for (int i = 1; i <= 8; ++i) { x[i] = -11; } sort(a + 1, a + n + 1); int c1 = 0, c2 = 0; for (int i = 1; i <= n; ++i) { if (a[i].ss.ff <= 4) c1 += 100; else c2 += 100; if (a[i].ff - x[a[i].ss.ff] <= 10) { if (a[i].ss.ff <= 4) c1 += 50; else c2 += 50; } x[a[i].ss.ff] = a[i].ff; } cout << c1 << ' ' << c2 << nl; } int main (/* <3 */) { qataima (); int zxc = 1; // cin >> zxc; while (zxc--) { ma1n(); } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...