제출 #506217

#제출 시각아이디문제언어결과실행 시간메모리
506217Hacv16Ljeto (COCI21_ljeto)C++17
50 / 50
1 ms312 KiB
#include<bits/stdc++.h> using namespace std; typedef long long ll; typedef pair<int, int> pii; const int MAX = 2e6 + 15; const int INF = 0x3f3f3f3f; const int MOD = 1e9 + 7; #define pb push_back #define sz(x) (int) x.size() #define fr first #define sc second #define mp make_pair #define all(x) x.begin(), x.end() int main(){ ios_base::sync_with_stdio(false); cin.tie(NULL); int n; cin >> n; int p1 = 0, p2 = 0; vector<int> lt(9, -INF); //last point from ith player for(int i = 0; i < n; i++){ int t, a, b, c = 100; cin >> t >> a >> b; if(t - lt[a] <= 10) c += 50; if(a <= 4) p1 += c; else p2 += c; lt[a] = t; } cout << p1 << ' ' << p2 << '\n'; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...