# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
693728 | amirhoseinfar1385 | Swap (BOI16_swap) | C++17 | 0 ms | 212 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;
vector<vector<int>>dp,mergy;
vector<int>all;
int n;
int calmina(int a,int b,int pi,int pii){
int wi=upper_bound(mergy[pi].begin(),mergy[pi].end(),min(a,b))-mergy[pi].begin();
int wii=upper_bound(mergy[pii].begin(),mergy[pii].end(),min(a,b))-mergy[pii].begin();
if(dp[pi][wi]<dp[pii][wii]){
if(b==min(a,b)){
return dp[pi][wi];
}
else{
int z=upper_bound(mergy[pii].begin(),mergy[pii].end(),b)-mergy[pii].begin();
return dp[pii][z];
}
}
else{
if(b==min(a,b)){
return dp[pii][wii];
}
else{
int z=upper_bound(mergy[pi].begin(),mergy[pi].end(),b)-mergy[pi].begin();
return dp[pi][z];
}
}
}
vector<int>merge(vector<int>a,vector<int>b){
# | 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... |