Submission #525871

#TimeUsernameProblemLanguageResultExecution timeMemory
525871BackNoobLjeto (COCI21_ljeto)C++14
50 / 50
1 ms332 KiB
#include <bits/stdc++.h> #define ll long long #define fi first #define se second #define endl '\n' #define MASK(i) (1LL << (i)) #define ull unsigned long long #define ld long double #define pb push_back #define all(x) (x).begin() , (x).end() #define BIT(x , i) ((x >> (i)) & 1) #define TASK "task" #define sz(s) (int) (s).size() using namespace std; const int mxN = 3e5 + 227; const int inf = 1e9 + 277; const int mod = 1e9 + 7; const ll infll = 1e18 + 7; const int base = 307; const int LOG = 20; template <typename T1, typename T2> bool minimize(T1 &a, T2 b) { if (a > b) {a = b; return true;} return false; } template <typename T1, typename T2> bool maximize(T1 &a, T2 b) { if (a < b) {a = b; return true;} return false; } int n; int pre[10]; void solve() { memset(pre , -0x3f , sizeof(pre)); cin >> n; int ans1 = 0 , ans2 = 0; for(int i = 1 ; i <= n ; i++) { int t , x , y; cin >> t >> x >> y; if(1 <= x && x <= 4) { ans1 += 100; if(t - pre[x] <= 10) ans1 += 50; pre[x] = t; } else { ans2 += 100; if(t - pre[x] <= 10) ans2 += 50; pre[x] = t; } } cout << ans1 << ' ' << ans2 << endl; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); //freopen(TASK".in" , "r" , stdin); //freopen(TASK".out" , "w" , stdout); int tc = 1; //cin >> tc; while(tc--) { solve(); } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...