Submission #874545

#TimeUsernameProblemLanguageResultExecution timeMemory
874545ngjabachLjeto (COCI21_ljeto)C++14
50 / 50
1 ms500 KiB
// NgJaBach: Forever Meadow <3 #include<bits/stdc++.h> using namespace std; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); typedef long long int ll; typedef unsigned long long ull; #define pb push_back #define pob pop_back #define mp make_pair #define upb upper_bound #define lwb lower_bound #define bend(a) a.begin(),a.end() #define rev(x) reverse(bend(x)) #define mset(a) memset(a, 0, sizeof(a)) #define fi first #define se second #define gcd __gcd #define getl(s) getline(cin, s); #define setpre(x) fixed << setprecision(x) #define endl '\n' const int N=200050,M=1000000007; const ll INF=1e18+7; int cumtime[10]; int main(){ ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); // freopen(".inp","r",stdin); // freopen(".out","w",stdout); int q,t,a,b,A=0,B=0,extra; for(int i=1;i<=8;++i) cumtime[i]=-1; cin>>q; while(q--){ cin>>t>>a>>b; extra=0; if(cumtime[a]!=-1 and (t-cumtime[a])<=10) extra=50; cumtime[a]=t; if(a<=4) A+=extra+100; else B+=extra+100; } cout<<A<<" "<<B; return 0; } /* ==================================+ INPUT: | ------------------------------ | ------------------------------ | ==================================+ OUTPUT: | ------------------------------ | ------------------------------ | ==================================+ */
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...