oj.uz

답안 #101597

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
101597 2019-03-19T04:56:18 Z Utaha 자동 인형 (IOI18_doll) C++14
70.6719 / 100
 149 ms 14824 KB 
/*input

*/
#include <bits/stdc++.h>
#include "doll.h"
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<double,double> pdd;
#define IOS ios_base::sync_with_stdio(0); cin.tie(0)
#define ALL(a) a.begin(),a.end()
#define SZ(a) ((int)a.size())
#define F first
#define S second
#define REP(i,n) for(int i=0;i<((int)n);i++)
#define pb push_back
#define MP(a,b) make_pair(a,b)
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define GET_POS(c,x) (lower_bound(c.begin(),c.end(),x)-c.begin())
template<typename T1,typename T2>
ostream& operator<<(ostream& out,pair<T1,T2> P){
  out<<'('<<P.F<<','<<P.S<<')';
  return out;
}

//}}}
const ll maxn=1000005;
const ll maxlg=__lg(maxn)+2;
const ll INF64=8000000000000000000LL;
const int INF=0x3f3f3f3f;
const ll MOD=ll(1e9+7);
const double PI=acos(-1);
//const ll p=880301;
//const ll P=31;
int lg=1;
int revbit(int n){
  int ret=0;
  REP(i,lg) if(n&(1<<i)){
    ret^=(1<<(lg-1-i));
  }
  return ret;
}
int rev[maxn];
bool cmp(int i,int j){
  return rev[i]<rev[j];
}
vector<int> C,X,Y;
int pt=1;
int L[maxn],R[maxn];
vector<int> order;
vector<int> r;
int idx[maxn];
void create_circuit(int m,vector<int> a){
  if(SZ(a)==1){
    C.resize(m+1);
    REP(i,SZ(C)) C[i]=0;
    C[0]=a[0];
    C[a[0]]=0;
    answer(C,X,Y);
    return; 
  }
  a.pb(0);
  int n=SZ(a)-1;
  REP(i,m+1) C.pb(-1);
  int N=2;
  while(N<n+1){
    N<<=1;
    ++lg;
  }
  REP(i,n) order.pb(i);
  order.pb(N-1);
  REP(i,N) rev[i]=revbit(i);
  sort(ALL(order),cmp);
  r.resize(N);
  // for(int i:order) cout<<i<<' ';
  // cout<<endl;
  REP(i,SZ(order)){
    // cout<<"QAQ"<<order[i]<<' '<<i<<'\n';
    r[order[i]]=i;
  }
  // REP(i,SZ(C)) cout<<C[i]<<" \n"[i==SZ(C)-1];
  // cout<<"N:"<<N<<'\n';
  L[1]=0;R[1]=N;

  for(int i=1;i<N/2;i++){
    int mid=(L[i]+R[i])/2;
    L[i<<1]=L[i];R[i<<1]=mid;
    L[(i<<1)|1]=mid;R[(i<<1)|1]=R[i];
  }
  int pt=0;
  for(int i=1;i<N;i++){
    if(L[i]>=n&&R[i]!=N) continue;
    idx[i]=pt++;
  }
  X.resize(pt);
  Y.resize(pt);
  // cout<<r[N-1]<<' '<<a[n-1]<<'\n';
  for(int i=1;i<N;i++){
    if(L[i]>=n&&R[i]!=N) continue;
    if(L[i]==R[i]-2){
      if(L[i]<n) X[idx[i]]=a[r[L[i]]];
      else X[idx[i]]=-1;

      if(L[i]+1>=n&&R[i]!=N) Y[idx[i]]=-1;
      else if(L[i]+1==N-1){
        Y[idx[i]]=0;
      }
      else Y[idx[i]]=a[r[L[i]+1]];
      continue;
    }
    int mid=(L[i]+R[i])/2;
    X[idx[i]]=-1-idx[i<<1];
    if(R[i]!=N&&mid>=n) Y[idx[i]]=-1;
    else Y[idx[i]]=-1-idx[(i<<1)|1];
  }
  // cout<<SZ(X)<<'\n';
  // REP(i,SZ(X)) cout<<-1-i<<' '<<X[i]<<' '<<Y[i]<<'\n';
  answer(C,X,Y);
}

// vector<int> meow;
// int main()
// {
//  int n,m;
//  cin>>m>>n;
//  meow.resize(n);
//  REP(i,n) cin>>meow[i];
//  create_circuit(m,meow);
//  return 0;
// }

Subtask #1
0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 332 KB Output is correct
2 Correct 2 ms 204 KB Output is correct
3 Correct 3 ms 204 KB Output is correct
4 Correct 2 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 2 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct

Subtask #5
14.7580402392 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 1 ms 332 KB Output is partially correct
2 Correct 86 ms 10232 KB Output is correct
3 Partially correct 89 ms 10188 KB Output is partially correct
4 Partially correct 125 ms 13408 KB Output is partially correct

Subtask #6
45.9139029664 / 56.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 1 ms 332 KB Output is partially correct
2 Correct 86 ms 10232 KB Output is correct
3 Partially correct 89 ms 10188 KB Output is partially correct
4 Partially correct 125 ms 13408 KB Output is partially correct
5 Partially correct 131 ms 14824 KB Output is partially correct
6 Partially correct 133 ms 14400 KB Output is partially correct
7 Partially correct 141 ms 14464 KB Output is partially correct
8 Partially correct 128 ms 14108 KB Output is partially correct
9 Partially correct 83 ms 10360 KB Output is partially correct
10 Partially correct 128 ms 14048 KB Output is partially correct
11 Partially correct 122 ms 13732 KB Output is partially correct
12 Partially correct 86 ms 10436 KB Output is partially correct
13 Correct 116 ms 10908 KB Output is correct
14 Partially correct 86 ms 11068 KB Output is partially correct
15 Partially correct 119 ms 11072 KB Output is partially correct
16 Partially correct 4 ms 588 KB Output is partially correct
17 Correct 90 ms 8852 KB Output is correct
18 Correct 88 ms 10436 KB Output is correct
19 Partially correct 85 ms 10420 KB Output is partially correct
20 Partially correct 126 ms 13896 KB Output is partially correct
21 Partially correct 123 ms 13756 KB Output is partially correct
22 Partially correct 149 ms 13732 KB Output is partially correct