# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1114132 | SalihSahin | Netrpeljivost (COI23_netrpeljivost) | C++14 | 373 ms | 98740 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 pb push_back
#define int long long
using namespace std;
const int inf = 1e15 + 10;
const int N = 2048 + 10;
vector<vector<int> > c(N, vector<int>(N));
vector<vector<int> > dp[N];
int ans;
void f(int node, int l, int r){
if(l == r){
dp[node].resize(1);
dp[node][0].resize(1);
dp[node][0][0] = 0;
return;
}
int m = (l + r)/2;
f(node * 2, l, m);
f(node * 2 + 1, m+1, r);
int sz = (r - l + 1);
if(node == 1){
vector<int> ldp(sz/2, inf), rdp(sz/2, inf);
for(int i = 0; i < sz/2; i++){
for(int j = 0; j < sz/2; j++){
# | 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... |