oj.uz

Submission #1060616

# Submission time Handle Problem Language Result Execution time Memory
1060616 2024-08-15T19:11:59 Z MarwenElarbi A Light Inconvenience (CEOI23_light) C++17
5 / 100
 325 ms 428 KB 
#include <bits/stdc++.h>
using namespace std;
#include "light.h"
#define ll long long
#define fi first
#define se second
#define pb push_back
vector<ll> cur;
long long n=1;
void prepare(){
    cur.pb(1);
}

std::pair<long long, std::vector<long long>> join(long long p){
	cur.clear();
    n+=p;
    long long i=1;
    while(n-i+1>1){
        cur.pb(n-i+1);
        i*=2;
    }
    cur.pb(1);
    sort(cur.begin(),cur.end());
	return {p*5 , cur};
}

std::pair<long long, std::vector<long long>> leave(long long p){
    cur.clear();
	n-=p;
    ll i=1;
    while(n-i+1>1){
        cur.pb(n-i+1);
        i*=2;
    }
    cur.pb(1);
    sort(cur.begin(),cur.end());
	return {p*5, cur};
}

Subtask #0
0.0 / 0.0

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

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 267 ms 428 KB Output is correct
3 Correct 255 ms 344 KB Output is correct
4 Correct 283 ms 344 KB Output is correct
5 Correct 310 ms 344 KB Output is correct
6 Correct 325 ms 344 KB Output is correct
7 Correct 293 ms 344 KB Output is correct
8 Correct 260 ms 344 KB Output is correct
9 Correct 303 ms 344 KB Output is correct
10 Correct 268 ms 344 KB Output is correct
11 Correct 299 ms 412 KB Output is correct

Subtask #2
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 0 ms 344 KB Not correct
3 Halted 0 ms 0 KB -

Subtask #3
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 0 ms 344 KB Not correct
3 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 Incorrect 0 ms 344 KB Not correct
3 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 Incorrect 0 ms 344 KB Not correct
3 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 Incorrect 0 ms 344 KB Not correct
3 Halted 0 ms 0 KB -

Subtask #7
0.0 / 60.0

# Verdict Execution time Memory Grader output
1 Partially correct 0 ms 344 KB Partially correct
2 Partially correct 281 ms 344 KB Partially correct
3 Partially correct 287 ms 344 KB Partially correct
4 Partially correct 283 ms 344 KB Partially correct
5 Partially correct 298 ms 344 KB Partially correct
6 Partially correct 275 ms 344 KB Partially correct
7 Partially correct 288 ms 344 KB Partially correct
8 Partially correct 308 ms 344 KB Partially correct
9 Partially correct 282 ms 344 KB Partially correct
10 Partially correct 293 ms 344 KB Partially correct
11 Partially correct 241 ms 412 KB Partially correct
12 Incorrect 0 ms 344 KB Not correct
13 Halted 0 ms 0 KB -