Submission #626676

#	Time	Username	Problem	Language	Result	Execution time	Memory
626676		vovamr	Ljeto (COCI21_ljeto)	C++17	50 / 50	1 ms	340 KiB

Main

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define fi first
#define se second
#define ll long long
#define ld long double
#define sz(x) ((int)(x).size())
#define all(x) 	(x).begin(), (x).end()
#define pb push_back
#define mpp make_pair
#define ve vector
using namespace std;
using namespace __gnu_pbds;
template<class T> using oset = tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;
const ll inf = 1e18; const int iinf = 1e9;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
template <typename T> inline bool chmin(T& a, T b) { return (a > b ? a = b, 1 : 0); }
template <typename T> inline bool chmax(T& a, T b) { return (a < b ? a = b, 1 : 0); }

inline void solve() {
	int n;
	cin >> n;
	ve<int> last(9, -iinf), sc(2);
	for (int i = 0; i < n; ++i) {
		int t, a, b;
		cin >> t >> a >> b;
		int pa = (a <= 4 ? 0 : 1);
		int pb = (b <= 4 ? 0 : 1);

		if (pa == pb) continue;

		sc[pa] += 100 + (last[a] >= t - 10 ? 50 : 0);
		last[a] = t;
	}
	cout << sc[0] << " " << sc[1];
}

signed main() {
	ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
	int q = 1; // cin >> q;
	while (q--) solve();
	cerr << fixed << setprecision(3) << "Time execution: " << (double)clock() / CLOCKS_PER_SEC << endl;
}

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