답안 #823386

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
823386	2023-08-12T12:49:14 Z	Dremix10	자동 인형 (IOI18_doll)	C++17	6 / 100	77 ms	11716 KB

doll

#include "doll.h"
#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define all(x) (x).begin(),(x).end()
typedef long long ll;
typedef pair<int,int> pi;
typedef pair<ll,ll> pl;
const int N = 3e5+5;
const ll INF = 1e18+5;
const int MOD = 1e9+7;

vector<int> x,y,c;
vector<vector<int> > nxt;

int solve(vector<int> &a){
    assert(!a.empty());
    int n = a.size();
    int i;

    bool ok = 1;
    int curr = a[0];
    vector<int> p1,p2;
    

    for(i=0;i<n-1;i+=2){
        if(curr != a[i] || curr != a[i+1])ok = 0;

        p1.push_back(a[i]);
        p2.push_back(a[i+1]);
    }

    if(ok){
        return curr;
    }

    if(n%2){
        /// we gotta add
        x.push_back(0);
        y.push_back(0);
        int res = x.size();
        p1.push_back(-res);
        p2.push_back(a.back());
        x[res-1] = solve(p1);
        y[res-1] = solve(p2);
        return -res;
    }
    else{
        int idx1 = solve(p1);
        int idx2 = solve(p2);
        x.push_back(idx1);
        y.push_back(idx2);
        int res = x.size();
        return -res;
    }


}

void create_circuit(int m, vector<int> arr) {
    int n = arr.size();

    c.resize(m+1);

    /// origin goes to first trigger
    c[0] = arr[0];

    int i;
    nxt.assign(m+1,vector<int>());

    for(i=0;i<n;i++){
        if(i < n-1)
            nxt[arr[i]].push_back(arr[i+1]);
        else
            nxt[arr[i]].push_back(0);
    }

    for(i=1;i<=m;i++){
        int cnt = nxt[i].size();

        if(cnt == 0)continue;
        else if(cnt == 1){
            c[i] = nxt[i][0];
        }
        else{
            int idx = x.size() + 1;
            c[i] = solve(nxt[i]);
        }

    }

    answer(c,x,y);

}

Compilation message

doll.cpp: In function 'void create_circuit(int, std::vector<int>)':
doll.cpp:87:17: warning: unused variable 'idx' [-Wunused-variable]
   87 |             int idx = x.size() + 1;
      |                 ^~~

Subtask #1
2.0 / 2.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	19 ms	6356 KB	Output is correct
3	Correct	15 ms	5204 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	9 ms	3796 KB	Output is correct
6	Correct	21 ms	7644 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct

Subtask #2
4.0 / 4.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	19 ms	6356 KB	Output is correct
3	Correct	15 ms	5204 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	9 ms	3796 KB	Output is correct
6	Correct	21 ms	7644 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	38 ms	7308 KB	Output is correct
9	Correct	34 ms	8656 KB	Output is correct
10	Correct	54 ms	11060 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct

Subtask #3
0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	19 ms	6356 KB	Output is correct
3	Correct	15 ms	5204 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	9 ms	3796 KB	Output is correct
6	Correct	21 ms	7644 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	38 ms	7308 KB	Output is correct
9	Correct	34 ms	8656 KB	Output is correct
10	Correct	54 ms	11060 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Incorrect	77 ms	11716 KB	wrong motion
15	Halted	0 ms	0 KB	-