# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
396943 | Andyvanh1 | Boxes with souvenirs (IOI15_boxes) | C++14 | 0 ms | 0 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 <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <stack>
#include <queue>
#include <map>
#include <math.h>
using namespace std;
#define pb push_back
#define INF INT32_MAX
#define vt vector
typedef vt<int> vi;
typedef pair<int,int> pii;
typedef tuple<int,int,int> tiii;
typedef long long ll;
int n;
#define MOD 1000000007
vt<vi> adjlist(1);
vt<char> node(1);
vt<int> endd(1);
vt<int> par(1);
vt<int> depth(1);
vt<bool> mark;
int id;
int cur = 0;
void build(string str){
int cur = 0;
int at = 0;
while(at!=str.length()){
bool bol = false;
for(auto& e: adjlist[cur]){
if(e==par[cur])continue;
if(node[e]==str[at]){
at++;
cur = e;
bol = true;
break;
}
}
if(!bol)break;
}
if(at==str.length()){
endd[cur]++;
return;
}
at--;
while(at!=str.length()-1){
adjlist.pb(vi(0));
adjlist[cur].pb(id);
adjlist[id].pb(cur);
depth.pb(at+1);
par.pb(cur);
node.pb(str[at+1]);
endd.pb(0);
cur = id;
at++;id++;
}
endd[id-1]++;
}
vt<bool> visited;
void dfs(int noder){
cur++;
visited[noder] = true;
if(endd[noder]){
for(int i = 0; i < endd[noder]; i++)
cout<<"P"<<'\n';
}
int scrib = -1;
for(auto& e: adjlist[noder]){
if(mark[e]&&!visited[e]){
scrib = e;
continue;
}
if(!visited[e]){
cout<<string(1,node[e])<<'\n';
dfs(e);
}
}
if(scrib!=-1){
cout<<string(1,node[scrib])<<'\n';
dfs(scrib);
}
if(cur!=adjlist.size()) {
cout << "-" << '\n';
}
}
void specbuild(string str){
mark.resize(adjlist.size());
for(int i = 0; i < adjlist.size(); i++){
mark[i] = false;
}
int cur = 0;
int at = 0;
while(at!=str.length()){
bool bol = false;
for(auto& e: adjlist[cur]){
if(e==par[cur])continue;
if(node[e]==str[at]){
at++;
cur = e;
mark[cur] = true;
bol = true;
break;
}
}
if(!bol)break;
}
}
int dp[1000005][4];
ll delivery(int n, int k, int l, vi arr){
if(k==1){
ll ans = 0;
for(int i = 0; i < n; i++){
ans+=2*min(arr[i],l-arr[i]);
}
return ans;
}else if(k==n){
if(arr[n-1]<=l/2){
return arr[n-1]*2;
}else if(arr[0]>l/2){
return 2* (l-arr[0]);
}else{
return l;
}
}
return 0;
}