# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1068980 | Huseyn123 | Werewolf (IOI18_werewolf) | C++17 | 867 ms | 138996 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 "werewolf.h"
#include <bits/stdc++.h>
#define MAX 200001
#define pb push_back
using namespace std;
vector<int> f(vector<int> &a,vector<int> &b){
int i,j;
i=j=0;
vector<int> res;
while(i<(int)a.size() && j<(int)b.size()){
if(a[i]<b[j]){
res.pb(a[i]);
i++;
}
else{
res.pb(b[j]);
j++;
}
}
while(i<(int)a.size()){
res.pb(a[i]);
i++;
}
while(j<(int)b.size()){
res.pb(b[j]);
j++;
}
return res;
}
struct segtree{
# | 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... |