# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
397381 | AQT | Group Photo (JOI21_ho_t3) | C++14 | 482 ms | 452 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>
using namespace std;
int N;
int arr[5005];
int dp[5005];
int cst[5005][5005];
int bit[5005];
int pos[5005];
void upd(int p){
p++;
while(p <= N){
bit[p]++;
p += p&-p;
}
}
int query(int p){
p++;
int ret = 0;
while(p){
ret += bit[p];
p -= p & -p;
}
return ret;
}
int main(){
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |