# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1028912 | vjudge1 | Netrpeljivost (COI23_netrpeljivost) | C++17 | 537 ms | 66388 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.
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define OYY LLONG_MAX
#define mod 998244353
#define faster ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define FOR for(int i=1;i<=n;i++)
#define mid (start+end)/2
#define lim 2050
#define fi first
#define se second
int n;
int dizi[lim][lim];
int dp[lim][lim];
inline pair<int,int> find(int cur,int x){
int tut,cev=0;
for(int i=31;i>=0;i--){
if((cur&(1ll<<i))!=((cur+1)&(1ll<<i))){
tut=i;
cev+=(x&(1ll<<i))?0:(1ll<<i);
break;
}
else cev+=(x&(1ll<<i))?(1ll<<i):0;
}
//cout<<cur<<" "<<x<<" "<<tut<<endl;
Compilation message (stderr)
# | 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... |