oj.uz

Submission #1056099

# Submission time Handle Problem Language Result Execution time Memory
1056099 2024-08-13T07:45:32 Z mindiyak A Light Inconvenience (CEOI23_light) C++17
5 / 100
 1000 ms 856848 KB 
#include "light.h"
#pragma GCC optimize("O1,O2,O3,Ofast,unroll-loops")
#include <bits/stdc++.h>
#include <string>
#include <iostream>
#include <cmath>
#include <numeric>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<int, int> pl;
typedef pair<ld, ld> pd;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<vector<int>> vvi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
#define FOR(i, a, b) for (int i = a; i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define FORd(i, a, b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i, a) for (int i = (a)-1; i >= 0; i--)
#define trav(a, x) for (auto &a : x)
#define uid(a, b) uniform_int_distribution<int>(a, b)(rng)
#define len(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define F first
#define nl endl
#define S second
#define lb lower_bound
#define ub upper_bound
#define aint(x) x.begin(), x.end()
#define raint(x) x.rbegin(), x.rend()
#define ins insert
const int MOD = 1000000007;
ll cnt;
ll last = 0;

void prepare(){
	cnt = 0;
}

pair<ll, vl> check(ll p){
	ll K = 5;
	set<ll> arr;
	int pos = 0;
	while(pos < cnt){
		arr.insert(pos+1);
		pos += K;
	}

	ll ans = max(cnt - last,K);
	arr.insert(cnt+1);
	last = cnt;
	
	vl arr2;
	for(ll a:arr){
		arr2.pb(a);
	}

	return {ans,arr2};
}

pair<ll, vl> join(ll p){
	cnt += p;
	return check(p);
}

pair<ll, vl> leave(ll p){
	cnt -= p;
	return check(p);
}

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct

Subtask #1
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Execution timed out 3118 ms 833448 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 384 ms 484 KB Output is correct
3 Correct 65 ms 344 KB Output is correct
4 Correct 356 ms 344 KB Output is correct
5 Correct 371 ms 344 KB Output is correct
6 Correct 6 ms 340 KB Output is correct
7 Correct 345 ms 344 KB Output is correct
8 Correct 27 ms 344 KB Output is correct
9 Correct 344 ms 456 KB Output is correct
10 Correct 360 ms 344 KB Output is correct
11 Correct 104 ms 344 KB Output is correct
12 Correct 366 ms 344 KB Output is correct

Subtask #3
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 384 ms 484 KB Output is correct
3 Correct 65 ms 344 KB Output is correct
4 Correct 356 ms 344 KB Output is correct
5 Correct 371 ms 344 KB Output is correct
6 Correct 6 ms 340 KB Output is correct
7 Correct 345 ms 344 KB Output is correct
8 Correct 27 ms 344 KB Output is correct
9 Correct 344 ms 456 KB Output is correct
10 Correct 360 ms 344 KB Output is correct
11 Correct 104 ms 344 KB Output is correct
12 Correct 366 ms 344 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 422 ms 344 KB Output is correct
15 Correct 72 ms 344 KB Output is correct
16 Correct 367 ms 344 KB Output is correct
17 Correct 362 ms 600 KB Output is correct
18 Correct 7 ms 344 KB Output is correct
19 Correct 339 ms 344 KB Output is correct
20 Correct 26 ms 344 KB Output is correct
21 Correct 347 ms 344 KB Output is correct
22 Correct 445 ms 344 KB Output is correct
23 Correct 112 ms 344 KB Output is correct
24 Correct 316 ms 344 KB Output is correct
25 Incorrect 1 ms 344 KB Not correct
26 Halted 0 ms 0 KB -

Subtask #4
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 384 ms 484 KB Output is correct
3 Correct 65 ms 344 KB Output is correct
4 Correct 356 ms 344 KB Output is correct
5 Correct 371 ms 344 KB Output is correct
6 Correct 6 ms 340 KB Output is correct
7 Correct 345 ms 344 KB Output is correct
8 Correct 27 ms 344 KB Output is correct
9 Correct 344 ms 456 KB Output is correct
10 Correct 360 ms 344 KB Output is correct
11 Correct 104 ms 344 KB Output is correct
12 Correct 366 ms 344 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 422 ms 344 KB Output is correct
15 Correct 72 ms 344 KB Output is correct
16 Correct 367 ms 344 KB Output is correct
17 Correct 362 ms 600 KB Output is correct
18 Correct 7 ms 344 KB Output is correct
19 Correct 339 ms 344 KB Output is correct
20 Correct 26 ms 344 KB Output is correct
21 Correct 347 ms 344 KB Output is correct
22 Correct 445 ms 344 KB Output is correct
23 Correct 112 ms 344 KB Output is correct
24 Correct 316 ms 344 KB Output is correct
25 Incorrect 1 ms 344 KB Not correct
26 Halted 0 ms 0 KB -

Subtask #5
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 384 ms 484 KB Output is correct
3 Correct 65 ms 344 KB Output is correct
4 Correct 356 ms 344 KB Output is correct
5 Correct 371 ms 344 KB Output is correct
6 Correct 6 ms 340 KB Output is correct
7 Correct 345 ms 344 KB Output is correct
8 Correct 27 ms 344 KB Output is correct
9 Correct 344 ms 456 KB Output is correct
10 Correct 360 ms 344 KB Output is correct
11 Correct 104 ms 344 KB Output is correct
12 Correct 366 ms 344 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 422 ms 344 KB Output is correct
15 Correct 72 ms 344 KB Output is correct
16 Correct 367 ms 344 KB Output is correct
17 Correct 362 ms 600 KB Output is correct
18 Correct 7 ms 344 KB Output is correct
19 Correct 339 ms 344 KB Output is correct
20 Correct 26 ms 344 KB Output is correct
21 Correct 347 ms 344 KB Output is correct
22 Correct 445 ms 344 KB Output is correct
23 Correct 112 ms 344 KB Output is correct
24 Correct 316 ms 344 KB Output is correct
25 Incorrect 1 ms 344 KB Not correct
26 Halted 0 ms 0 KB -

Subtask #6
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 384 ms 484 KB Output is correct
3 Correct 65 ms 344 KB Output is correct
4 Correct 356 ms 344 KB Output is correct
5 Correct 371 ms 344 KB Output is correct
6 Correct 6 ms 340 KB Output is correct
7 Correct 345 ms 344 KB Output is correct
8 Correct 27 ms 344 KB Output is correct
9 Correct 344 ms 456 KB Output is correct
10 Correct 360 ms 344 KB Output is correct
11 Correct 104 ms 344 KB Output is correct
12 Correct 366 ms 344 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 422 ms 344 KB Output is correct
15 Correct 72 ms 344 KB Output is correct
16 Correct 367 ms 344 KB Output is correct
17 Correct 362 ms 600 KB Output is correct
18 Correct 7 ms 344 KB Output is correct
19 Correct 339 ms 344 KB Output is correct
20 Correct 26 ms 344 KB Output is correct
21 Correct 347 ms 344 KB Output is correct
22 Correct 445 ms 344 KB Output is correct
23 Correct 112 ms 344 KB Output is correct
24 Correct 316 ms 344 KB Output is correct
25 Incorrect 1 ms 344 KB Not correct
26 Halted 0 ms 0 KB -

Subtask #7
0.0 / 60.0

# Verdict Execution time Memory Grader output
1 Partially correct 0 ms 596 KB Partially correct
2 Execution timed out 3114 ms 856848 KB Time limit exceeded
3 Halted 0 ms 0 KB -