제출 #1176870

#제출 시각아이디문제언어결과실행 시간메모리
1176870ChocoLjeto (COCI21_ljeto)C++20
25 / 50
0 ms328 KiB
#include<bits/stdc++.h> using namespace std; #define Study ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL) #define ll long long #define ull unsigned long long #define pb push_back #define ff first #define ss second #define ins insert #define all(x) x.begin(),x.end() #define fori(x,y,z) for(ll x=y;x<=z;x++) const ll INF=1e9; const ll sz=2e5+10; const ll mod=1e9+7; void work(){ ll n; cin>>n; ll ta=0,tb=0; vector<pair<ll,pair<ll,ll>>>v(n+10); vector<pair<ll,pair<ll,ll>>>a,b; fori(i,1,n){ cin>>v[i].ff>>v[i].ss.ff>>v[i].ss.ss; if(v[i].ss.ff<=4) a.pb({v[i].ff,{v[i].ss.ff,v[i].ss.ss}}); else b.pb({v[i].ff,{v[i].ss.ff,v[i].ss.ss}}); } fori(i,1,n){ if(v[i].ss.ff<=4) ta+=100; else tb+=100; } fori(i,0,(ll)a.size()-1){ fori(j,0,i-1) if(a[i].ff-a[j].ff<=10 && a[i].ss.ff==a[j].ss.ff) ta+=50; } //cout<<a.size()<<' '<<b.size()<<endl; fori(i,0,(ll)b.size()-1){ fori(j,0,i-1) if(b[i].ff-b[j].ff<=10 && b[i].ss.ff==b[j].ss.ff) tb+=50; } cout<<ta<<' '<<tb; } int main(){ Study; ll t=1; //cin>>t; fori(i,1,t){ work(); } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...