# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
742168 | vanic | Nizovi (COI14_nizovi) | C++14 | 191 ms | 304 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.
//NIJE TVOJ KOD - SLUZBENO RJESENJE
#include <algorithm>
#include <cassert>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <string>
#include <vector>
#include <iostream>
using namespace std;
typedef long long llint;
int main(void)
{
int n_a, n_b; scanf("%d %d", &n_a, &n_b);
vector<int> lb(n_a);
llint op_suma = 0;
int cmd_cnt = 0;
auto out_rev = [&cmd_cnt, &op_suma](int lo, int hi) { // [lo, hi>
if (lo >= hi) return;
printf("reverse %d %d\n", lo+1, hi); fflush(stdout);
op_suma += hi - lo;
++cmd_cnt;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |