Submission #1176917

#TimeUsernameProblemLanguageResultExecution timeMemory
1176917fritlLjeto (COCI21_ljeto)C++20
25 / 50
0 ms328 KiB
#include <bits/stdc++.h> using namespace std; using ll=long long; #define cimbom ios_base::sync_with_stdio(false);cin.tie();cout.tie() #define endl '\n' #define fori for(ll i=0; i<n; i++) #define forj for(ll j=1; j<=n; j++) #define forv for(ll i=0; i<v.size(); i++) #define forg for(ll g=0; g<v.size(); g++) #define fork for(ll k=2; k<=n; k++) #define mp make_pair #define pb push_back #define eb emplace_back #define pr pair<int, int> #define ff first #define ss second #define sorta sort(a,a+n) #define sortv sort(v.begin(), v.end()) #define sorts sort(s.begin(), s.end()) #define mod 1000000007 #define INF 1000000000 #define MAX 100000001 signed main(){ cimbom; ll n,m,b,c,d,e,f=-1,t,say=0,cem=0,cem1=0,say1=0; cin>>n; bool k=true,k1=0; vector<pair<ll,ll>> v,v1; fori{ cin>>b>>c>>d; if(c<=4) v.pb(mp(c,b)); else v1.pb(mp(c,b));} sortv; sort(v1.begin(),v1.begin()); for(ll i=0;i<v.size();i++){ cem+=100; if(i!=v.size()-1 and v[i].ss+10>=v[i+1].ss and v[i].ff==v[i+1].ff){ cem+=50; } } for(ll i=0;i<v1.size();i++){ cem1+=100; if(i!=v1.size()-1 and v1[i].ss+10>=v1[i+1].ss and v1[i].ff==v1[i+1].ff){ cem1+=50; } } cout<<cem<<" "<<cem1; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...