oj.uz

답안 #835587

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
835587 2023-08-23T16:20:33 Z Dremix10 자동 인형 (IOI18_doll) C++17
53 / 100
 136 ms 14656 KB 
    #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(curr != a[n-1])ok = 0;
     
        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*-1);
            p2.push_back(a.back());

            //cerr<<idx1<<endl;
            x[res-1] = solve(p1);

            y[res-1] = solve(p2);

            return res*-1;
        }
        else{

            int idx2 = solve(p2);
            x.push_back(solve(p1));
            y.push_back(idx2);
            int res = x.size();
            //cerr<<res*-1<<":"<<endl;
            //cerr<<idx1<<" "<<idx2<<endl;
            return res*-1;
        }
     
     
    }
     
    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);
     
    }

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 25 ms 6356 KB Output is correct
3 Correct 14 ms 5076 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 8 ms 3796 KB Output is correct
6 Correct 21 ms 7636 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 25 ms 6356 KB Output is correct
3 Correct 14 ms 5076 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 8 ms 3796 KB Output is correct
6 Correct 21 ms 7636 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 34 ms 7356 KB Output is correct
9 Correct 34 ms 8656 KB Output is correct
10 Correct 54 ms 11072 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 25 ms 6356 KB Output is correct
3 Correct 14 ms 5076 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 8 ms 3796 KB Output is correct
6 Correct 21 ms 7636 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 34 ms 7356 KB Output is correct
9 Correct 34 ms 8656 KB Output is correct
10 Correct 54 ms 11072 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 70 ms 11732 KB Output is correct
15 Correct 42 ms 5872 KB Output is correct
16 Correct 59 ms 8980 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 61 ms 11188 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct

Subtask #4
0 / 10.0

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

Subtask #5
9.0000000036 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 0 ms 212 KB Output is partially correct
2 Correct 11 ms 2764 KB Output is correct
3 Partially correct 71 ms 10236 KB Output is partially correct
4 Correct 16 ms 4552 KB Output is correct

Subtask #6
28.0000000112 / 56.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 0 ms 212 KB Output is partially correct
2 Correct 11 ms 2764 KB Output is correct
3 Partially correct 71 ms 10236 KB Output is partially correct
4 Correct 16 ms 4552 KB Output is correct
5 Partially correct 93 ms 13204 KB Output is partially correct
6 Partially correct 97 ms 13984 KB Output is partially correct
7 Partially correct 94 ms 13760 KB Output is partially correct
8 Partially correct 111 ms 14412 KB Output is partially correct
9 Partially correct 76 ms 9508 KB Output is partially correct
10 Partially correct 136 ms 14440 KB Output is partially correct
11 Partially correct 108 ms 14656 KB Output is partially correct
12 Partially correct 69 ms 9688 KB Output is partially correct
13 Partially correct 71 ms 9196 KB Output is partially correct
14 Partially correct 64 ms 9068 KB Output is partially correct
15 Partially correct 62 ms 8704 KB Output is partially correct
16 Partially correct 2 ms 468 KB Output is partially correct
17 Partially correct 73 ms 7588 KB Output is partially correct
18 Partially correct 57 ms 7592 KB Output is partially correct
19 Partially correct 61 ms 8180 KB Output is partially correct
20 Partially correct 96 ms 10440 KB Output is partially correct
21 Partially correct 94 ms 12608 KB Output is partially correct
22 Partially correct 73 ms 9564 KB Output is partially correct