# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
644586 | ymm | Fortune Telling 2 (JOI14_fortune_telling2) | C++17 | 3057 ms | 6856 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 <bits/stdc++.h>
#define Loop(x,l,r) for (ll x = (l); x < (r); ++x)
#define LoopR(x,l,r) for (ll x = (r)-1; x >= (l); --x)
typedef long long ll;
typedef std::pair<int, int> pii;
typedef std::pair<ll , ll > pll;
using namespace std;
const int N = 200'010;
int a[N], b[N];
int n;
/*
void up(int x)
{
Loop (i,0,n)
a[i] ^= a[i] <= x? b[i]: 0;
}
*/
void up(int);
asm("\n"
" .text\n"
" .p2align 4\n"
" .globl _Z2upi\n"
" .type _Z2upi, @function\n"
"_Z2upi:\n"
".myLFB9703:\n"
" .cfi_startproc\n"
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |