oj.uz

답안 #713085

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
713085 2023-03-21T03:33:21 Z lam Unscrambling a Messy Bug (IOI16_messy) C++17
38 / 100
 3 ms 340 KB 
#include <bits/stdc++.h>
#define ll long long
#include "messy.h"
using namespace std;
inline bool checkbit(ll i, int j)
{
    return i>>j&1;
}
inline string tostring(ll x, int n)
{
    string s="";
    for (int i=0; i<n; i++)
    {
        if (x%2LL==0) s+='0';
        else s+='1';
        x/=2LL;
    }
    return s;
}
vector<int32_t> restore_permutation(int32_t n, int32_t w, int32_t r) {
    string s="";
    for (int i=0; i<n; i++) s+='0';
    for (int i=n-1; i>=1; i--)
    {
        s[i] = '1';
        add_element(s);
    }
    compile_set();
    vector <int32_t> res(n);
    ll mask = 0LL;
    for (int it=0; it<n-1; it++)
    {
        vector <int> tmp; for (int j=0; j<n; j++) if (!checkbit(mask,j)) tmp.push_back(j);
        random_shuffle(tmp.begin(),tmp.end());
        random_shuffle(tmp.begin(),tmp.end());
        random_shuffle(tmp.begin(),tmp.end());
        random_shuffle(tmp.begin(),tmp.end());
        for (int j:tmp)
        {
            mask^=(1LL<<j);
            bool check = check_element(tostring(mask,n));
            if (!check)
            {
                mask^=(1LL<<j);
                continue;
            }
            for (int jj=0; jj<n; jj++)
                if (checkbit(mask,jj)) res[jj]++;
            break;
        }
    }
    return res;
}

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB n = 8
2 Correct 1 ms 212 KB n = 8
3 Correct 1 ms 252 KB n = 8
4 Correct 1 ms 212 KB n = 8
5 Correct 0 ms 212 KB n = 8
6 Correct 1 ms 212 KB n = 8
7 Correct 1 ms 212 KB n = 8
8 Correct 1 ms 212 KB n = 8
9 Correct 1 ms 212 KB n = 8
10 Correct 0 ms 212 KB n = 8
11 Correct 0 ms 212 KB n = 8
12 Correct 0 ms 212 KB n = 8
13 Correct 0 ms 212 KB n = 8
14 Correct 1 ms 212 KB n = 8
15 Correct 0 ms 212 KB n = 8

Subtask #2
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB n = 32
2 Correct 1 ms 212 KB n = 32
3 Correct 1 ms 304 KB n = 32
4 Correct 1 ms 212 KB n = 32
5 Correct 1 ms 212 KB n = 32
6 Correct 1 ms 212 KB n = 32
7 Correct 1 ms 212 KB n = 32
8 Correct 1 ms 212 KB n = 32
9 Correct 1 ms 212 KB n = 32
10 Correct 1 ms 212 KB n = 32
11 Correct 1 ms 212 KB n = 32
12 Correct 1 ms 212 KB n = 32
13 Correct 1 ms 212 KB n = 32
14 Correct 1 ms 212 KB n = 32
15 Correct 1 ms 212 KB n = 32

Subtask #3
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 212 KB grader returned WA
2 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 340 KB grader returned WA
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 340 KB grader returned WA
2 Halted 0 ms 0 KB -