답안 #1028654

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1028654	2024-07-20T06:44:28 Z	mindiyak	자동 인형 (IOI18_doll)	C++14	6 / 100	83 ms	12864 KB

doll

#include "doll.h"
#pragma GCC optimize("O1,O2,O3,Ofast,unroll-loops")
#include <bits/stdc++.h>
#include <string>
#include <iostream>
#include <cmath>
#include <numeric>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<int, int> pl;
typedef pair<ld, ld> pd;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<vector<int>> vvi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
#define FOR(i, a, b) for (int i = a; i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define FORd(i, a, b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i, a) for (int i = (a)-1; i >= 0; i--)
#define trav(a, x) for (auto &a : x)
#define uid(a, b) uniform_int_distribution<int>(a, b)(rng)
#define len(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define F first
#define nl endl
#define S second
#define lb lower_bound
#define ub upper_bound
#define aint(x) x.begin(), x.end()
#define raint(x) x.rbegin(), x.rend()
#define ins insert
const int MOD = 1000000007;

int N,M;

void create_circuit(int m, vi A) {
  A.pb(0);
  N = A.size();M=m;
  vi C(M + 1,0),X,Y;

  vvi counters(M+1,vi());
  FOR(i,0,N-1){
    counters[A[i]].pb(A[i+1]);
  }

  int mx = 0;
  FOR(i,0,M+1){
    mx = max(mx,int(counters[i].size()));
  }
  counters[0].pb(A[0]);

  // FOR(i,0,M+1){
  //   cout << i << " {";
  //   for(int j:counters[i])cout<<j << " ,";
  //   cout<<"}"<<endl;
  // }

  if(false){
  // if(mx==4){
    FOR(i,0,M+1){
      if(counters[i].size() == 1){
        C[i] = counters[i][0];
      }else if(counters[i].size() == 2){
        X.pb(counters[i][0]);
        Y.pb(counters[i][1]);
        C[i] = X.size()*-1;
      }else if(counters[i].size() == 3){
        int k = -X.size();
        C[i] = k-1;
        X.pb(k-2);
        Y.pb(k-3);
        X.pb(counters[i][0]);
        Y.pb(k-1);
        X.pb(counters[i][1]);
        Y.pb(counters[i][2]);
      }else if(counters[i].size() == 4){
        int k = -X.size();
        C[i] = k-1;
        X.pb(k-2);
        Y.pb(k-3);
        X.pb(counters[i][0]);
        Y.pb(counters[i][2]);
        X.pb(counters[i][1]);
        Y.pb(counters[i][3]);
      }
    }
    C[0] = A[0];

    // FOR(i,0,M+1)cout << C[i] << " ";
    // cout << endl;
    // FOR(i,0,X.size())cout << X[i] << " " << Y[i] << endl;

    answer(C, X, Y);
    return;
  }

  FOR(i,0,M+1){
    if(counters[i].size() == 0)continue;
    if(counters[i].size() == 1){
      C[i] = counters[i][0];
      continue;
    }
    int num = ceil(log2(counters[i].size()));

    int k = -X.size();

    C[i] = k-1;
    FOR(j,0,num-1){
      X.pb(k-1-j);
      Y.pb(k-1-j);
    }

    // cout << i << " " << counters[i].size() << " " << num << endl;

    vector<pair<string,int>> arr(pow(2,num));
    FOR(j,0,pow(2,num)){
      string a = "";
      int k = j;
      FOR(l,0,num){
        if(k%2 == 1)a += "1";
        else a += "0";
        k/=2;
      }
      reverse(a.begin(),a.end());
      arr[j] = {a,j};
    }
    sort(arr.begin(),arr.end());

    // FOR(j,0,pow(2,num)){
    //   cout << arr[j].S << " ";
    // }cout << endl;

    for(int j = 0;j < pow(2,num);j+=2){
      if(arr[j].S < counters[i].size())
        X.pb(counters[i][arr[j].S]);
      else 
        X.pb(k-1);

      if(arr[j+1].S < counters[i].size())
        Y.pb(counters[i][arr[j+1].S]);
      else
        Y.pb(k-1);
    }

    
    // else if(counters[i].size() == 2){
    //   X.pb(counters[i][0]);
    //   Y.pb(counters[i][1]);
    //   C[i] = X.size()*-1;
    // }else if(counters[i].size() == 3){
    //   int k = -X.size();
    //   C[i] = k-1;
    //   X.pb(k-2);
    //   Y.pb(k-3);
    //   X.pb(counters[i][0]);
    //   Y.pb(k-1);
    //   X.pb(counters[i][1]);
    //   Y.pb(counters[i][2]);
    // }else if(counters[i].size() == 4){
    //   int k = -X.size();
    //   C[i] = k-1;
    //   X.pb(k-2);
    //   Y.pb(k-3);
    //   X.pb(counters[i][0]);
    //   Y.pb(counters[i][2]);
    //   X.pb(counters[i][1]);
    //   Y.pb(counters[i][3]);
    // }
  }

  // cout << "sdas" << endl;
  // for(int x:X)cout << x << " ";
  // cout << endl;
  // for(int y:Y)cout << y << " ";
  // cout << endl;
  // cout << "asdasd" << endl;

  answer(C, X, Y);
}

Compilation message

doll.cpp: In function 'void create_circuit(int, vi)':
doll.cpp:141:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  141 |       if(arr[j].S < counters[i].size())
doll.cpp:146:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  146 |       if(arr[j+1].S < counters[i].size())

Subtask #1
2.0 / 2.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	21 ms	6996 KB	Output is correct
3	Correct	25 ms	5720 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	7 ms	3932 KB	Output is correct
6	Correct	30 ms	8396 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct

Subtask #2
4.0 / 4.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	21 ms	6996 KB	Output is correct
3	Correct	25 ms	5720 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	7 ms	3932 KB	Output is correct
6	Correct	30 ms	8396 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	49 ms	8356 KB	Output is correct
9	Correct	41 ms	9596 KB	Output is correct
10	Correct	65 ms	12864 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	1 ms	344 KB	Output is correct

Subtask #3
0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	21 ms	6996 KB	Output is correct
3	Correct	25 ms	5720 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	7 ms	3932 KB	Output is correct
6	Correct	30 ms	8396 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	49 ms	8356 KB	Output is correct
9	Correct	41 ms	9596 KB	Output is correct
10	Correct	65 ms	12864 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	1 ms	344 KB	Output is correct
14	Incorrect	83 ms	12372 KB	over 20000000 inversions
15	Halted	0 ms	0 KB	-