Submission #926676

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
926676	2024-02-13T13:56:07 Z	GrindMachine	Mechanical Doll (IOI18_doll)	C++17	6 / 100	39 ms	7888 KB

doll

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*



*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

#include "doll.h"

void create_circuit(int m, std::vector<int> a) {
    // int N = A.size();
    // std::vector<int> C(M + 1);
    // C[0] = -1;
    // for (int i = 1; i <= M; ++i) {
    //     C[i] = 1;
    // }
    // std::vector<int> X(N), Y(N);
    // for (int k = 0; k < N; ++k) {
    //     X[k] = Y[k] = A[k];
    // }
    // answer(C, X, Y);

    int n = sz(a);
    vector<int> b(m+1), sx(1), sy(1);

    vector<int> cnt(m+1);
    rep(i,n) cnt[a[i]]++;
    rep(i,m+1){
        if(cnt[i] == 1){
            a.pb(i);
        }
    }

    auto on = n;
    n = sz(a);
    b[0] = a[0];
    vector<int> switch_id(m+1,-1); // trigger i is connected to which switch?
    int ptr = 1;

    rep(i,n){
        int x = a[i];
        if(switch_id[x] == -1){
            switch_id[x] = ptr;
            b[x] = -ptr;
            sx.pb(0);
            sy.pb(0);
            if(i+1 < on){
                sx[ptr] = a[i+1];
            }
            else if(i+1 < n){
                sx[ptr] = -switch_id[a[i+1]];
            }
            ptr++;
        }
        else{
            b[x] = -switch_id[x];
            if(i+1 < on){
                sy[switch_id[x]] = a[i+1];
            }
            else if(i+1 < n){
                sy[switch_id[x]] = -switch_id[a[i+1]];
            }
        }
    }

    sx.erase(sx.begin());
    sy.erase(sy.begin());
    debug(b);
    debug(sx);
    debug(sy);

    answer(b,sx,sy);
}

Compilation message

doll.cpp: In function 'void create_circuit(int, std::vector<int>)':
doll.cpp:46:18: warning: statement has no effect [-Wunused-value]
   46 | #define debug(x) 42
      |                  ^~
doll.cpp:120:5: note: in expansion of macro 'debug'
  120 |     debug(b);
      |     ^~~~~
doll.cpp:46:18: warning: statement has no effect [-Wunused-value]
   46 | #define debug(x) 42
      |                  ^~
doll.cpp:121:5: note: in expansion of macro 'debug'
  121 |     debug(sx);
      |     ^~~~~
doll.cpp:46:18: warning: statement has no effect [-Wunused-value]
   46 | #define debug(x) 42
      |                  ^~
doll.cpp:122:5: note: in expansion of macro 'debug'
  122 |     debug(sy);
      |     ^~~~~

Subtask #1
2.0 / 2.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	28 ms	4948 KB	Output is correct
3	Correct	20 ms	4184 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	7 ms	2396 KB	Output is correct
6	Correct	31 ms	5844 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct

Subtask #2
4.0 / 4.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	28 ms	4948 KB	Output is correct
3	Correct	20 ms	4184 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	7 ms	2396 KB	Output is correct
6	Correct	31 ms	5844 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	26 ms	4676 KB	Output is correct
9	Correct	34 ms	7304 KB	Output is correct
10	Correct	39 ms	7888 KB	Output is correct
11	Correct	1 ms	504 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct

Subtask #3
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	28 ms	4948 KB	Output is correct
3	Correct	20 ms	4184 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	7 ms	2396 KB	Output is correct
6	Correct	31 ms	5844 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	26 ms	4676 KB	Output is correct
9	Correct	34 ms	7304 KB	Output is correct
10	Correct	39 ms	7888 KB	Output is correct
11	Correct	1 ms	504 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Incorrect	33 ms	6576 KB	wrong motion
15	Halted	0 ms	0 KB	-