oj.uz

답안 #75126

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
75126 2018-09-08T12:33:35 Z faustaadp 자동 인형 (IOI18_doll) C++17
53 / 100
 180 ms 22772 KB 
#include "doll.h"
#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
#define fi first
#define se second
using namespace std;
ll i,Sa=0,DU[202020],j,TR;
vector<ll> v[202020],isi;
vector<int> C,XXI,YYI;
void gawe(ll aa,ll bb,ll cc,ll dd)
{
    //cout<<i<<" "<<aa<<" "<<bb<<" "<<cc<<"\n";
    if(aa==1)
    {
       // cout<<bb<<"\n";
        XXI[dd]=(isi[bb]);
        YYI[dd]=(isi[bb+(1<<(cc-1))]);
        return ;
    }
    TR++;
    XXI[dd]=-TR-1;
    gawe(aa-1,bb,cc,TR);
    TR++;
    YYI[dd]=-TR-1;
  //  cout<<i<<" "<<cc<<" "<<aa<<" "<<(1<<(cc-aa))<<"\n";
    gawe(aa-1,bb+(1<<(cc-aa)),cc,TR);
}
void create_circuit(int M, std::vector<int> A) {
    int N = A.size();
    for(i=0;i<=M;i++)
        C.pb(0);
    v[0].pb(A[0]);
    for(i=0;i<N-1;i++)
        v[A[i]].pb(A[i+1]);
    for(i=0;i<=200000;i++)
    {
        for(j=20;j>=0;j--)
        {
            ll HA=(1<<j);
            if(HA>=i)
                DU[i]=j;
        }
    }
    v[A[N-1]].pb(0);
    //return ;
    for(i=0;i<=M;i++)
    {
        if(v[i].size()==0)
            continue;
        else
        if(v[i].size()==1)
        {
          //  cout<<v[i][0]<<"\n";
            C[i]=v[i][0];
            continue;
        }
        else
        {
            C[i]=-TR-1;
            ll SZ=v[i].size();
            ll GED=DU[SZ];
            //cout<<SZ<<" "<<GED<<"\n";
            isi.clear();
           // cout<<GED<<"GED\n";
            for(j=0;j<((1<<GED)-SZ);j++)
                isi.pb(-TR-1);
            for(j=0;j<v[i].size();j++)
                isi.pb(v[i][j]);
            for(j=1;j<isi.size();j++)
            {
                XXI.pb(0);
                YYI.pb(0);
       //         cout<<j<<" "<<isi[j]<<"\n";
            }
            gawe(GED,0,GED,TR);
            TR=XXI.size();
            while((TR-1>=0)&&XXI[TR-1]==0&&YYI[TR-1]==0)
            {
                XXI.pop_back();
                YYI.pop_back();
                TR--;
            }
         //   TR+=isi.size();
            //TR+=GED;
        }
    }
//    for(i=0;i<=M;i++)cout<<i<<" "<<C[i]<<"\n";
  //  for(i=0;i<XXI.size();i++)cout<<-i-1<<" "<<XXI[i]<<" "<<YYI[i]<<"\n";
  //  cout<<C.size()<<" "<<XXI.size()<<" "<<YYI.size()<<"\n";
    answer(C, XXI, YYI);
}

Compilation message

doll.cpp: In function 'void create_circuit(int, std::vector<int>)':
doll.cpp:69:22: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   69 |             for(j=0;j<v[i].size();j++)
      |                     ~^~~~~~~~~~~~
doll.cpp:71:22: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   71 |             for(j=1;j<isi.size();j++)
      |                     ~^~~~~~~~~~~

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 6492 KB Output is correct
2 Correct 54 ms 10352 KB Output is correct
3 Correct 41 ms 9960 KB Output is correct
4 Correct 14 ms 6536 KB Output is correct
5 Correct 29 ms 7924 KB Output is correct
6 Correct 59 ms 11620 KB Output is correct
7 Correct 12 ms 6588 KB Output is correct

Subtask #2
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 6492 KB Output is correct
2 Correct 54 ms 10352 KB Output is correct
3 Correct 41 ms 9960 KB Output is correct
4 Correct 14 ms 6536 KB Output is correct
5 Correct 29 ms 7924 KB Output is correct
6 Correct 59 ms 11620 KB Output is correct
7 Correct 12 ms 6588 KB Output is correct
8 Correct 88 ms 12728 KB Output is correct
9 Correct 85 ms 12656 KB Output is correct
10 Correct 130 ms 15260 KB Output is correct
11 Correct 12 ms 6616 KB Output is correct
12 Correct 15 ms 6548 KB Output is correct
13 Correct 15 ms 6604 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 6492 KB Output is correct
2 Correct 54 ms 10352 KB Output is correct
3 Correct 41 ms 9960 KB Output is correct
4 Correct 14 ms 6536 KB Output is correct
5 Correct 29 ms 7924 KB Output is correct
6 Correct 59 ms 11620 KB Output is correct
7 Correct 12 ms 6588 KB Output is correct
8 Correct 88 ms 12728 KB Output is correct
9 Correct 85 ms 12656 KB Output is correct
10 Correct 130 ms 15260 KB Output is correct
11 Correct 12 ms 6616 KB Output is correct
12 Correct 15 ms 6548 KB Output is correct
13 Correct 15 ms 6604 KB Output is correct
14 Correct 136 ms 18860 KB Output is correct
15 Correct 89 ms 12240 KB Output is correct
16 Correct 127 ms 15148 KB Output is correct
17 Correct 15 ms 6592 KB Output is correct
18 Correct 13 ms 6604 KB Output is correct
19 Correct 14 ms 6496 KB Output is correct
20 Correct 135 ms 17256 KB Output is correct
21 Correct 15 ms 6604 KB Output is correct
22 Correct 15 ms 6604 KB Output is correct

Subtask #4
0 / 10.0

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

Subtask #5
9.0000000036 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 15 ms 6604 KB Output is partially correct
2 Correct 81 ms 13748 KB Output is correct
3 Partially correct 120 ms 19336 KB Output is partially correct
4 Partially correct 116 ms 19988 KB Output is partially correct

Subtask #6
28.0000000112 / 56.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 15 ms 6604 KB Output is partially correct
2 Correct 81 ms 13748 KB Output is correct
3 Partially correct 120 ms 19336 KB Output is partially correct
4 Partially correct 116 ms 19988 KB Output is partially correct
5 Partially correct 167 ms 20076 KB Output is partially correct
6 Partially correct 167 ms 21428 KB Output is partially correct
7 Partially correct 143 ms 20872 KB Output is partially correct
8 Partially correct 165 ms 22128 KB Output is partially correct
9 Partially correct 127 ms 16376 KB Output is partially correct
10 Partially correct 154 ms 22476 KB Output is partially correct
11 Partially correct 180 ms 22772 KB Output is partially correct
12 Partially correct 124 ms 17112 KB Output is partially correct
13 Partially correct 122 ms 16448 KB Output is partially correct
14 Partially correct 110 ms 16152 KB Output is partially correct
15 Partially correct 98 ms 15572 KB Output is partially correct
16 Partially correct 14 ms 6936 KB Output is partially correct
17 Partially correct 81 ms 14940 KB Output is partially correct
18 Partially correct 94 ms 15072 KB Output is partially correct
19 Partially correct 129 ms 15680 KB Output is partially correct
20 Partially correct 176 ms 18164 KB Output is partially correct
21 Partially correct 177 ms 20624 KB Output is partially correct
22 Partially correct 129 ms 17236 KB Output is partially correct