oj.uz

답안 #835583

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
835583 2023-08-23T16:19:14 Z Dremix10 자동 인형 (IOI18_doll) C++17
53 / 100
 115 ms 14640 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);
            int idx2 = solve(p2);
            y[res-1] = idx2;

            return res*-1;
        }
        else{
            int idx1 = solve(p1);
            int idx2 = solve(p2);
            x.push_back(idx1);
            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 18 ms 6404 KB Output is correct
3 Correct 14 ms 5076 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 8 ms 3796 KB Output is correct
6 Correct 25 ms 7640 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 18 ms 6404 KB Output is correct
3 Correct 14 ms 5076 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 8 ms 3796 KB Output is correct
6 Correct 25 ms 7640 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 34 ms 7336 KB Output is correct
9 Correct 35 ms 8656 KB Output is correct
10 Correct 53 ms 11000 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 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 18 ms 6404 KB Output is correct
3 Correct 14 ms 5076 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 8 ms 3796 KB Output is correct
6 Correct 25 ms 7640 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 34 ms 7336 KB Output is correct
9 Correct 35 ms 8656 KB Output is correct
10 Correct 53 ms 11000 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 82 ms 11828 KB Output is correct
15 Correct 36 ms 5948 KB Output is correct
16 Correct 58 ms 8964 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 65 ms 11176 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 0 ms 212 KB Output is correct

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 212 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 74 ms 10516 KB Output is partially correct
4 Correct 18 ms 4336 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 74 ms 10516 KB Output is partially correct
4 Correct 18 ms 4336 KB Output is correct
5 Partially correct 115 ms 13280 KB Output is partially correct
6 Partially correct 100 ms 14000 KB Output is partially correct
7 Partially correct 95 ms 13736 KB Output is partially correct
8 Partially correct 104 ms 14372 KB Output is partially correct
9 Partially correct 76 ms 9608 KB Output is partially correct
10 Partially correct 110 ms 14332 KB Output is partially correct
11 Partially correct 109 ms 14640 KB Output is partially correct
12 Partially correct 72 ms 9608 KB Output is partially correct
13 Partially correct 68 ms 9232 KB Output is partially correct
14 Partially correct 62 ms 8964 KB Output is partially correct
15 Partially correct 59 ms 8648 KB Output is partially correct
16 Partially correct 2 ms 468 KB Output is partially correct
17 Partially correct 56 ms 7624 KB Output is partially correct
18 Partially correct 58 ms 7596 KB Output is partially correct
19 Partially correct 90 ms 8152 KB Output is partially correct
20 Partially correct 82 ms 10444 KB Output is partially correct
21 Partially correct 95 ms 12524 KB Output is partially correct
22 Partially correct 77 ms 9464 KB Output is partially correct