oj.uz

Submission #835580

# Submission time Handle Problem Language Result Execution time Memory
835580 2023-08-23T16:18:22 Z Dremix10 Mechanical Doll (IOI18_doll) C++17
53 / 100
 109 ms 16164 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());
            int idx1 = solve(p1);
            //cerr<<idx1<<endl;
            x[res-1] = idx1;
            int idx2 = solve(p2);
            y[res-1] = idx2;
            //cerr<<idx2<<endl;
            //cerr<<res*-1<<": "<<endl;
            //cerr<<x[res-1]<<" "<<y[res-1]<<endl;
            //for(auto x : p1)cerr<<x<<" ";
            //cerr<<endl;
            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

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 20 ms 6368 KB Output is correct
3 Correct 15 ms 5176 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 8 ms 3796 KB Output is correct
6 Correct 21 ms 7696 KB Output is correct
7 Correct 1 ms 212 KB Output is correct

Subtask #2
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 20 ms 6368 KB Output is correct
3 Correct 15 ms 5176 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 8 ms 3796 KB Output is correct
6 Correct 21 ms 7696 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 33 ms 7324 KB Output is correct
9 Correct 37 ms 8672 KB Output is correct
10 Correct 50 ms 11084 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 20 ms 6368 KB Output is correct
3 Correct 15 ms 5176 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 8 ms 3796 KB Output is correct
6 Correct 21 ms 7696 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 33 ms 7324 KB Output is correct
9 Correct 37 ms 8672 KB Output is correct
10 Correct 50 ms 11084 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 70 ms 11748 KB Output is correct
15 Correct 39 ms 5956 KB Output is correct
16 Correct 57 ms 10356 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 64 ms 12592 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

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
9.0000000036 / 18.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 212 KB Output is partially correct
2 Correct 11 ms 2868 KB Output is correct
3 Partially correct 75 ms 11160 KB Output is partially correct
4 Correct 18 ms 5832 KB Output is correct

Subtask #6
28.0000000112 / 56.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 212 KB Output is partially correct
2 Correct 11 ms 2868 KB Output is correct
3 Partially correct 75 ms 11160 KB Output is partially correct
4 Correct 18 ms 5832 KB Output is correct
5 Partially correct 95 ms 14728 KB Output is partially correct
6 Partially correct 99 ms 15392 KB Output is partially correct
7 Partially correct 100 ms 15180 KB Output is partially correct
8 Partially correct 106 ms 15768 KB Output is partially correct
9 Partially correct 81 ms 10500 KB Output is partially correct
10 Partially correct 109 ms 15852 KB Output is partially correct
11 Partially correct 109 ms 16164 KB Output is partially correct
12 Partially correct 71 ms 10640 KB Output is partially correct
13 Partially correct 68 ms 10180 KB Output is partially correct
14 Partially correct 65 ms 9976 KB Output is partially correct
15 Partially correct 58 ms 9680 KB Output is partially correct
16 Partially correct 2 ms 568 KB Output is partially correct
17 Partially correct 63 ms 8608 KB Output is partially correct
18 Partially correct 57 ms 8544 KB Output is partially correct
19 Partially correct 63 ms 9128 KB Output is partially correct
20 Partially correct 81 ms 11816 KB Output is partially correct
21 Partially correct 102 ms 14056 KB Output is partially correct
22 Partially correct 78 ms 10940 KB Output is partially correct