# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
365476 | tfg | Zalmoxis (BOI18_zalmoxis) | C++17 | 282 ms | 10476 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
#include <vector>
#include <chrono>
#include <random>
#include <cassert>
std::mt19937 rng((int) std::chrono::steady_clock::now().time_since_epoch().count());
const int ms = 1001000;
int n, k;
int a[ms], b[ms];
int main() {
std::ios_base::sync_with_stdio(false); std::cin.tie(NULL);
std::cin >> n >> k;
for(int i = 0; i < n; i++) {
std::cin >> a[i];
}
for(int p = 0; p < 30; p++) {
int j = 0;
for(int i = 0; i < n;) {
if(std::abs(a[i]) > p) {
b[j++] = a[i++];
} else {
int sum = 0;
//std::cout << "starting from " << i << std::endl;
while(i < n && std::abs(a[i]) <= p) {
b[j++] = a[i];
sum += 1 << std::abs(a[i++]);
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |