Submission #917381

#TimeUsernameProblemLanguageResultExecution timeMemory
917381lumidLjeto (COCI21_ljeto)C++17
50 / 50
1 ms420 KiB
// Source: https://usaco.guide/general/io #include <bits/stdc++.h> #include <climits> using namespace std; typedef long long ll; typedef unsigned long long ull; typedef vector<int> vi; typedef pair<int, int> ii; typedef vector<ii> vii; typedef long double ld; typedef pair<ll, ll> pll; #define FOR(i, a, b) for(int i = a; i < b; i++) #define ROF(i, a, b) for(int i = a; i >= b; i--) #define ms memset #define pb push_back #define fi first #define se second #define inp(n, a) vector<ll> a;for(int i=0;i<n;i++){ll now;cin>>now;a.pb(now);} #define all(a) a.begin(),a.end() #define show(a) for(long long loppls=0;loppls<(long long)(a.size()-1);loppls++)cout<<a[loppls]<<' ';cout<<a[a.size()-1]; #ifdef reimufumo #define owo(x) std::cerr << x; #define ovo(a) for(long long loppls=0;loppls<(long long)(a.size()-1);loppls++)cerr<<a[loppls]<<' ';cerr<<a[a.size()-1]; #define ouo(a,x) for(long long loppls=0;loppls<x-1;loppls++)cerr<<a[loppls]<<' ';cerr<<a[x-1]; #define dbg(x) std::cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << std::endl #define dbgif(cond, x) ((cond) ? std::cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << std::endl : std::cerr) #else #define owo(x) ((void)0) #define ovo(a) ((void)0) #define ouo(a,x) ((void)0) #define dbg(x) ((void)0) #define dbgif(cond, x) ((void)0) #endif long long binpow(long long a, long long b, long long m) { a %= m; long long res = 1; while (b > 0) { if (b & 1) res = res * a % m; a = a * a % m; b >>= 1; } return res; } long long inv(long long a, long long p){ return binpow(a, p-2, p); } vector<ll> fact; // must be init if nCk needed long long nCk(long long n, long long k, long long p){ return ((fact[n] * inv(fact[k], p) % p) * inv(fact[n-k], p)) % p; } ll sum2(ll a, ll l, ll n){return (n*(a+l))/2;} ll ceil2(ll a, ll b){return (a+b-1)/b;} const ll INF=1e16,MAX=200020,MOD=998244353; void solve() { ll n;cin>>n; vector<ll> last(9,-INF),ans(2); for(int i=0;i<n;i++){ ll t,a,b;cin>>t>>a>>b; ans[(ll)((a-1)/4)]+=100; if(t-last[a]<=10)ans[(ll)((a-1)/4)]+=50; last[a]=t; } cout<<ans[0]<<" "<<ans[1]; } int main() { ios::sync_with_stdio(false); cin.tie(NULL); solve(); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...