oj.uz

Submission #769140

# Submission time Handle Problem Language Result Execution time Memory
769140 2023-06-29T08:45:12 Z Magikarp4000 Unscrambling a Messy Bug (IOI16_messy) C++17
38 / 100
 1 ms 340 KB 
#include "messy.h"
#include <bits/stdc++.h>
using namespace std;
#define OPTM ios_base::sync_with_stdio(0); cin.tie(0);
#define INF int(1e9+7)
#define ln '\n' 
#define ll long long
#define ull unsigned long long
#define ui unsigned int
#define us unsigned short
#define FOR(i,s,n) for (int i = s; i < n; i++)
#define FORR(i,n,s) for (int i = n; i > s; i--)
#define FORX(u, arr) for (auto u : arr)
#define PB push_back
#define in(v,x) (v.find(x) != v.end())
#define F first
#define S second
#define PII pair<int, int>
#define PLL pair<ll, ll>
#define UM unordered_map
#define US unordered_set
#define PQ priority_queue
#define ALL(v) v.begin(), v.end()
const ll LLINF = 1e18+1;

vector<int> sub2(int n) {
    string s = "";
    FOR(i,0,n) s.PB('0');
    FOR(i,0,n) {
        s[i] = '1';
        add_element(s);
    }
    compile_set();
    string t = "";
    FOR(i,0,n) t.PB('0');
    vector<int> p(n,-1);
    vector<int> v;
    FOR(i,0,n) v.PB(i);
    mt19937 rng(time(0));
    shuffle(ALL(v),rng);
    FOR(i,0,n) {
        FOR(j,0,n) {
            if (t[v[j]] == '1') continue;
            t[v[j]] = '1';
            if (check_element(t)) {
                p[v[j]] = i;
                break;
            }
            else t[v[j]] = '0';
        }
    }
    return p;
}

vector<int> sub3(int n) {
    string s = "";
    FOR(i,0,n) s.PB('0');
    FOR(i,0,n) {
        s[i] = '1';
        FOR(j,i+1,n) {
            s[j] = '1';
            add_element(s);
            s[j] = '0';
        }
    }
    compile_set();
    string t = "";
    FOR(i,0,n) t.PB('0');
    FOR(i,0,n) {

    }
}

std::vector<int> restore_permutation(int n, int w, int r) {
    if (w/n >= -100) return sub2(n);
    //else return sub3(n);
}

Compilation message

messy.cpp: In function 'std::vector<int> sub3(int)':
messy.cpp:72:1: warning: no return statement in function returning non-void [-Wreturn-type]
   72 | }
      | ^
messy.cpp: In function 'std::vector<int> restore_permutation(int, int, int)':
messy.cpp:77:1: warning: control reaches end of non-void function [-Wreturn-type]
   77 | }
      | ^

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB n = 8
2 Correct 0 ms 212 KB n = 8
3 Correct 1 ms 212 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 0 ms 212 KB n = 8
9 Correct 0 ms 212 KB n = 8
10 Correct 1 ms 212 KB n = 8
11 Correct 0 ms 212 KB n = 8
12 Correct 1 ms 212 KB n = 8
13 Correct 1 ms 212 KB n = 8
14 Correct 0 ms 212 KB n = 8
15 Correct 0 ms 212 KB n = 8

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB n = 32
2 Correct 0 ms 212 KB n = 32
3 Correct 0 ms 212 KB n = 32
4 Correct 0 ms 212 KB n = 32
5 Correct 1 ms 212 KB n = 32
6 Correct 0 ms 212 KB n = 32
7 Correct 0 ms 212 KB n = 32
8 Correct 1 ms 212 KB n = 32
9 Correct 0 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 0 ms 212 KB n = 32
14 Correct 0 ms 212 KB n = 32
15 Correct 0 ms 212 KB n = 32

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB n = 32
2 Correct 1 ms 212 KB n = 32
3 Correct 1 ms 212 KB n = 32
4 Correct 1 ms 212 KB n = 32
5 Correct 1 ms 300 KB n = 32
6 Correct 0 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 Incorrect 1 ms 212 KB grader returned WA
12 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 340 KB grader returned WA
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 340 KB grader returned WA
2 Halted 0 ms 0 KB -