Submission #780016

#	Time	Username	Problem	Language	Result	Execution time	Memory
780016		cig32	Ljeto (COCI21_ljeto)	C++17	50 / 50	1 ms	324 KiB

Main

#include "bits/stdc++.h"
using namespace std;
#define int long long
const int MAXN = 1e6 + 10;
const int MOD = 998244353;
mt19937_64 rng((int)std::chrono::steady_clock::now().time_since_epoch().count());
int rnd(int x, int y) {
  int u = uniform_int_distribution<int>(x, y)(rng); return u;
}
int bm(int b, int p) {
  if(p==0) return 1 % MOD;
  int r = bm(b, p >> 1);
  if(p&1) return (((r*r) % MOD) * b) % MOD;
  return (r*r) % MOD;
}
int inv(int b) { 
  return bm(b, MOD-2);
}
int fastlog(int x) {
  return (x == 0 ? -1 : 64 - __builtin_clzll(x) - 1);
}
void printcase(int i) { cout << "Case #" << i << ": "; }

void solve(int tc){
  int n;
  cin >> n;
  int last[9];
  for(int i=1; i<=8; i++) last[i] = -1e9;
  int p=0, b=0;
  for(int i=0; i<n; i++) {
    int x,y,t;
    cin>>t>>x>>y;
    int score=(t-last[x]<=10? 150: 100);
    last[x]=t;
    if(x<=4) p+=score;
    else b+=score;
  }
  cout<<p<<" "<<b<<"\n";
}
int32_t main() {
  ios::sync_with_stdio(0); cin.tie(0);
  int t = 1; //cin >> t;
  for(int i=1; i<=t; i++) solve(i);
}
// 勿忘初衷

• Subtask 1: 10 / 10
• Subtask 2: 15 / 15
• Subtask 3: 25 / 25