Submission #702124

#	Time	Username	Problem	Language	Result	Execution time	Memory
702124		shmad	Ljeto (COCI21_ljeto)	C++17	50 / 50	0 ms	328 KiB

Main

#pragma GCC optimize("O3", "unroll-loops") // "Ofast" 	
#pragma GCC target("avx2", "bmi", "bmi2", "lzcnt", "popcnt") 

#include <bits/stdc++.h>

#define int long long
#define vt vector
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
#define f first
#define s second
#define dbg(x) cerr << #x << " = " << x << '\n'
#define bit(x, i) ((x) >> (i) & 1)

using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;

const int N = 1e6 + 5, mod = 1e9 + 7;
const ll inf = 1e18 + 7;
const ld eps = 1e-6;

int n, tme[N];

void solve () {
	cin >> n;
	int res1 = 0, res2 = 0;
	for (int i = 1; i <= n; i++) {
	 	int t, a, b;
	 	cin >> t >> a >> b;
	 	if (a < 5) res1 += 100;
	 	else res2 += 100;
	 	if (tme[a] && t - tme[a] <= 10) {
	 		if (a < 5) res1 += 50;
	 		else res2 += 50;
		}
		tme[a] = t;
	}             	
	cout << res1 << ' ' << res2;
	cout << '\n';
}

bool testcases = 0;

signed main() {
#ifdef ONLINE_JUDGE
	freopen(".in", "r", stdin);
	freopen(".out", "w", stdout);
#endif
	cin.tie(0) -> sync_with_stdio(0);
	int test = 1;
	if (testcases) cin >> test;
	for (int cs = 1; cs <= test; cs++) {
		solve();
	}
}

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