Submission #702121

#	Time	Username	Problem	Language	Result	Execution time	Memory
702121		shmad	Ljeto (COCI21_ljeto)	C++17	25 / 50	1 ms	320 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;

void solve () {
	cin >> n;
	vt<array<int, 3>> v;
	for (int i = 1; i <= n; i++) {
	 	int t, a, b;
	 	cin >> t >> a >> b;
	 	v.pb({t, a, b});
	}
	sort(all(v));
	int res1 = 0, res2 = 0;
	for (int i = 0; i < n; i++) {
		int sc = 100;
		for (int j = 0; j < i; j++) {
			if (v[i][0] - v[j][0] <= 10 && v[i][1] == v[j][1]) sc += 50;
		}
		if (v[i][1] < 5) res1 += sc;
		else res2 += sc;
	}
	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: 0 / 25