oj.uz

Submission #1064432

# Submission time Handle Problem Language Result Execution time Memory
1064432 2024-08-18T12:36:22 Z Shadow1 Infinite Race (EGOI24_infiniterace2) C++17
34 / 100
 18 ms 4892 KB 
// Programmer: Shadow1

#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
using namespace std;

using ll = long long;
using ld = long double;
using ull = unsigned long long;
using str = string; // yay python!

#define i64 int64_t
#define show(x) cerr << (#x) << " = " << (x) << '\n';
#define output_vector(v) for(auto &x : v){cout << x << ' ';}cout << '\n';
#define output_pairvector(v) for(auto &x : v){cout << x.first << " " << x.second << '\n';}
#define vt vector
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define pii pair<int,int>
#define umap unordered_map
#define uset unordered_set
#define fir first
#define sec second
#define sz(x) ll(x.size())
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define int ll
#define discretize(x) sort(x.begin(), x.end()); x.erase(unique(x.begin(), x.end()), x.end());

// T: O(n^3)
// M : O(n + k log n) 

void solve() {
	int n, q;
	cin >> n >> q;
	vector<int> cnt(n), last(n);
	vector<bool> ahead(n);
	int lap = 1;
	while(q--) {
		int x; cin >> x;
		if(x > 0) {
			if(last[x] == lap) 
				++lap;
			
			last[x] = lap;
		}
	}
	cout << lap - 1 << '\n';
}
	


signed main() {
	// freopen("output.txt", "w", stdout);
	// freopen("input.txt", "r", stdin);
	ios::sync_with_stdio(false);
	cin.tie(NULL); 
	int T = 1;
	// cin >> T;

	while(T--)
		solve();
	return 0;
}

/* CHECK :
1. COMPARATOR FUNCTION MUST RETURN FALSE WHEN ARGUMENTS ARE EQUAL!!!
2. Overflow! Typecase int64_t on operations if varaibles are int
3. Check array bounds!!!
4. Check array indexing!!!
5. Edge cases. (N==1)!!!
*/

Subtask #1
0.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Incorrect 8 ms 824 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 7 ms 820 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 18 ms 4892 KB Output is correct
6 Correct 2 ms 3420 KB Output is correct
7 Correct 8 ms 724 KB Output is correct
8 Correct 7 ms 828 KB Output is correct
9 Correct 7 ms 760 KB Output is correct
10 Correct 9 ms 860 KB Output is correct
11 Correct 9 ms 1116 KB Output is correct
12 Correct 11 ms 1372 KB Output is correct
13 Correct 11 ms 2136 KB Output is correct
14 Correct 16 ms 4700 KB Output is correct
15 Correct 13 ms 4860 KB Output is correct
16 Correct 14 ms 4700 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 452 KB Output is correct
19 Correct 15 ms 4700 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 14 ms 4632 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 3420 KB Output is correct
24 Correct 1 ms 348 KB Output is correct

Subtask #3
0.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 416 KB Output is correct
4 Incorrect 0 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Incorrect 8 ms 824 KB Output isn't correct
5 Halted 0 ms 0 KB -