oj.uz

Submission #101501

# Submission time Handle Problem Language Result Execution time Memory
101501 2019-03-19T03:21:52 Z briansu Mechanical Doll (IOI18_doll) C++14
37 / 100
 210 ms 12616 KB 
//{
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double lf;
typedef pair<ll,ll> ii;
#define REP(i,n) for(ll i=0;i<n;i++)
#define REP1(i,n) for(ll i=1;i<=n;i++)
#define FILL(i,n) memset(i,n,sizeof i)
#define X first
#define Y second
#define SZ(_a) (int)_a.size()
#define ALL(_a) _a.begin(),_a.end()
#define pb push_back
#ifdef brian
#define debug(...) do{\
    fprintf(stderr,"%s - %d (%s) = ",__PRETTY_FUNCTION__,__LINE__,#__VA_ARGS__);\
    _do(__VA_ARGS__);\
}while(0)
template<typename T>void _do(T &&_x){cerr<<_x<<endl;}
template<typename T,typename ...S> void _do(T &&_x,S &&..._t){cerr<<_x<<" ,";_do(_t...);}
template<typename _a,typename _b> ostream& operator << (ostream &_s,const pair<_a,_b> &_p){return _s<<"("<<_p.X<<","<<_p.Y<<")";}
template<typename It> ostream& _OUTC(ostream &_s,It _ita,It _itb)
{
    _s<<"{";
    for(It _it=_ita;_it!=_itb;_it++)
    {
        _s<<(_it==_ita?"":",")<<*_it;
    }
    _s<<"}";
    return _s;
}
template<typename _a> ostream &operator << (ostream &_s,vector<_a> &_c){return _OUTC(_s,ALL(_c));}
template<typename _a> ostream &operator << (ostream &_s,set<_a> &_c){return _OUTC(_s,ALL(_c));}
template<typename _a,typename _b> ostream &operator << (ostream &_s,map<_a,_b> &_c){return _OUTC(_s,ALL(_c));}
template<typename _t> void pary(_t _a,_t _b){_OUTC(cerr,_a,_b);cerr<<endl;}
#define IOS()
#else
#define debug(...)
#define pary(...)
#define endl '\n'
#define IOS() ios_base::sync_with_stdio(0);cin.tie(0);
#endif // brian
//}

const ll MAXn = 200000 + 5;

vector<int> C, X, Y;
ll sit = 0;

#include "doll.h"

ll nnd(){
  X.pb(0);
  Y.pb(0);
  return --sit;
}

void build(ll now, vector<int> v)
{
  if(now == -1)v.pb(0);
  vector<int> d[2];
  d[0].clear();d[1].clear();
  if(SZ(v) & 1)d[0].pb(now);
  for(int i = 0, fg = (SZ(v) & 1);i < SZ(v);i++,fg = !fg){
    d[fg].pb(v[i]);
  }
  if(SZ(d[0]) == 1)X[-now-1] = d[0][0];
  else build(X[-now-1] = nnd(), d[0]);
  if(SZ(d[1]) == 1)Y[-now-1] = d[1][0];
  else build(Y[-now-1] = nnd(), d[1]);
}

void create_circuit(int M, std::vector<int> A) {
  X.clear();Y.clear();sit = 0;
  ll rt = nnd();
  build(rt, A);
  C.clear();
  REP(i, M+1)C.pb(rt);
  answer(C, X, Y);
}

Subtask #1
0 / 2.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
9.0 / 18.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 204 KB Output is partially correct
2 Partially correct 129 ms 11752 KB Output is partially correct
3 Partially correct 127 ms 11744 KB Output is partially correct
4 Partially correct 153 ms 11712 KB Output is partially correct

Subtask #6
28.0 / 56.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 204 KB Output is partially correct
2 Partially correct 129 ms 11752 KB Output is partially correct
3 Partially correct 127 ms 11744 KB Output is partially correct
4 Partially correct 153 ms 11712 KB Output is partially correct
5 Partially correct 156 ms 12616 KB Output is partially correct
6 Partially correct 144 ms 12476 KB Output is partially correct
7 Partially correct 148 ms 12540 KB Output is partially correct
8 Partially correct 146 ms 12452 KB Output is partially correct
9 Partially correct 128 ms 11740 KB Output is partially correct
10 Partially correct 143 ms 12420 KB Output is partially correct
11 Partially correct 210 ms 12060 KB Output is partially correct
12 Partially correct 153 ms 11900 KB Output is partially correct
13 Partially correct 130 ms 12132 KB Output is partially correct
14 Partially correct 143 ms 12224 KB Output is partially correct
15 Partially correct 141 ms 12188 KB Output is partially correct
16 Partially correct 5 ms 588 KB Output is partially correct
17 Correct 93 ms 5792 KB Output is correct
18 Partially correct 136 ms 11916 KB Output is partially correct
19 Partially correct 134 ms 11972 KB Output is partially correct
20 Partially correct 142 ms 12288 KB Output is partially correct
21 Partially correct 154 ms 12036 KB Output is partially correct
22 Partially correct 143 ms 12168 KB Output is partially correct