# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
67153 | quoriess | Hidden Sequence (info1cup18_hidden) | C++14 | 7 ms | 308 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>
#include "grader.h"
/*
g++ -Wall -grader.cpp -std=c++11 -c "%f"
* */
using namespace std;
vector<int> mult(int a,int x){
vector<int> ret;
for (int i = 0; i < x; i++)
{
ret.push_back(a);
}
return ret;
}
void yazdir(vector<int> yazi){
for (int i = 0; i < (int)yazi.size(); i++)
{
cout << yazi[i];
}
cout <<"\n";
}
vector < int > findSequence (int N)
{
vector < int > ans (N, 0);
int no0=0;
for (int i = 0; i <= N/2; i++)
{
if(isSubsequence(mult(0,i)))no0++;
else break;
}
//cout << "no 0: "<<no0<<"\n";
int fazla=0,az=1;
if(N-no0>=no0){
swap(fazla,az);
no0=N-no0;
}
//cout << "fazla: "<<fazla<<"\n";
//cout << "no 0: "<<no0<<"\n";
//cout << "geldi"<<"\n";
vector<int> templ=mult(fazla,no0);
//son fazlayı çıkarttı
int boslukind=no0+1;
//cout << boslukind<<"\n";
while(boslukind>=0 && (int)templ.size() < N){
vector<int> cpy=templ;
//yazdir(templ);
if(boslukind>no0)cpy.push_back(az);
else
cpy.insert(cpy.begin()+boslukind,az);
//yazdir(cpy);
if(isSubsequence(cpy)){
//cout << "ss\n";
templ=cpy;
}
else{
//cout << "?"<<"\n";
boslukind--;
continue;
}
}
vector<int> trueans;
for (int i = 0; i < N; i++)
{
if(templ[i]!=1904)trueans.push_back(templ[i]);
}
return trueans;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |