oj.uz

Submission #872744

# Submission time Handle Problem Language Result Execution time Memory
872744 2023-11-13T16:27:22 Z tsumondai Ljeto (COCI21_ljeto) C++14
15 / 50
 0 ms 464 KB 
#include <bits/stdc++.h>
using namespace std;

#define int long long
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define foru(i, l, r) for(int i = l; i <= r; i++)
#define ford(i, r, l) for(int i = r; i >= l; i--)
#define __TIME  (1.0 * clock() / CLOCKS_PER_SEC)

typedef pair<int, int> ii;
typedef pair<ii, int> iii;
typedef pair<ii, ii> iiii;
 
const int N = 1e6 + 5;
 
const int oo = 1e18, mod = 1e9 + 7;
 
int n, m, k, cnta=0, cntb=0, resa=0, resb=0, recent[N];
string s;
vector<iii> quer[3];

void process() {
	cin >> n;
	foru(i,1,n) {
		int t,a,b;
		cin >> t >> a >> b;
		if (a<=4) quer[1].pb({{t, a}, b});
		else quer[2].pb({{t, a}, b});
	}
	cnta=quer[1].size(); cntb=quer[2].size();
	resa=cnta*100, resb=cntb*100;
	foru(i,0,cnta-1) {
		int fr=quer[1][i].fi.se, to=quer[1][i].se, tim=quer[1][i].fi.fi;
		if (recent[fr]==0) {
			recent[fr]=tim;
			continue;
		}
		if (tim-recent[fr]<=10) resa+=50;
		recent[fr]=tim;
	}
	foru(i,0,cntb-1) {
		int fr=quer[2][i].fi.se, to=quer[2][i].se, tim=quer[2][i].fi.fi;
		if (recent[fr]==0) {
			recent[fr]=tim;
			continue;
		}
		if (tim-recent[fr]<=10) resa+=50;
		recent[fr]=tim;
	}
	cout << resa << ' ' << resb;
    return;
}

signed main() {
    cin.tie(0)->sync_with_stdio(false);
    //freopen(".inp", "r", stdin);
    //freopen(".out", "w", stdout);
    process();
    cerr << "Time elapsed: " << __TIME << " s.\n";
    return 0;
}

Compilation message

Main.cpp: In function 'void process()':
Main.cpp:36:28: warning: unused variable 'to' [-Wunused-variable]
   36 |   int fr=quer[1][i].fi.se, to=quer[1][i].se, tim=quer[1][i].fi.fi;
      |                            ^~
Main.cpp:45:28: warning: unused variable 'to' [-Wunused-variable]
   45 |   int fr=quer[2][i].fi.se, to=quer[2][i].se, tim=quer[2][i].fi.fi;
      |                            ^~

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 464 KB Output is correct

Subtask #3
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -