oj.uz

Submission #765425

# Submission time Handle Problem Language Result Execution time Memory
765425 2023-06-24T12:53:26 Z GrindMachine Hidden Sequence (info1cup18_hidden) C++17
34 / 100
 86 ms 296 KB 
// Om Namah Shivaya

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x, y) ((x + y - 1) / (y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i, n) for(int i = 0; i < n; ++i)
#define rep1(i, n) for(int i = 1; i <= n; ++i)
#define rev(i, s, e) for(int i = s; i >= e; --i)
#define trav(i, a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a, b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a, b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*

refs:
https://codeforces.com/blog/entry/58101?#comment-420242

*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

#include "grader.h"

vector<int> findSequence (int n)
{
    int zeros = 0;
    rep1(i,n){
        vector<int> v;
        rep1(j,i) v.pb(0);
        if(isSubsequence(v)){
            zeros++;
        }
        else{
            break;
        }
    }   

    int ones = n-zeros;
    vector<int> ans(n);

    rep1(i,ones){
        // find the pos of the ith one
        // find the #of zeros before the ith one
        int zeros_bef = 0;
        rep1(j,zeros){
            vector<int> v;
            rep1(k,j) v.pb(0);
            rep1(k,i) v.pb(1);

            bool ok = isSubsequence(v);

            if(ok){
                zeros_bef++;
            }
            else{
                break;
            }
        }

        int ones_bef = ones-i;
        int pos = zeros_bef + ones_bef;
        ans[pos] = 1;
    }

    return ans;
}

Compilation message

grader.cpp: In function 'int main()':
grader.cpp:28:26: warning: format '%d' expects argument of type 'int', but argument 3 has type 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wformat=]
   28 |     fprintf (fifo_out, "%d\n", ans.size ());
      |                         ~^     ~~~~~~~~~~~
      |                          |              |
      |                          int            std::vector<int>::size_type {aka long unsigned int}
      |                         %ld
grader.cpp:29:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   29 |     for (int i=0; i<ans.size () && i < N; i++)
      |                   ~^~~~~~~~~~~~

Subtask #1
10.0 / 20.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 208 KB Output is partially correct: Maximum length of a query = 6
2 Partially correct 1 ms 208 KB Output is partially correct: Maximum length of a query = 7
3 Partially correct 0 ms 208 KB Output is partially correct: Maximum length of a query = 6
4 Partially correct 1 ms 208 KB Output is partially correct: Maximum length of a query = 9
5 Partially correct 0 ms 208 KB Output is partially correct: Maximum length of a query = 6

Subtask #2
24.0 / 80.0

# Verdict Execution time Memory Grader output
1 Partially correct 49 ms 208 KB Output is partially correct: Maximum length of a query = 94
2 Partially correct 58 ms 208 KB Output is partially correct: Maximum length of a query = 103
3 Partially correct 63 ms 208 KB Output is partially correct: Maximum length of a query = 106
4 Partially correct 42 ms 280 KB Output is partially correct: Maximum length of a query = 91
5 Partially correct 48 ms 296 KB Output is partially correct: Maximum length of a query = 111
6 Partially correct 86 ms 284 KB Output is partially correct: Maximum length of a query = 151
7 Partially correct 56 ms 292 KB Output is partially correct: Maximum length of a query = 135
8 Partially correct 33 ms 288 KB Output is partially correct: Maximum length of a query = 96
9 Partially correct 64 ms 208 KB Output is partially correct: Maximum length of a query = 121
10 Partially correct 44 ms 208 KB Output is partially correct: Maximum length of a query = 105
11 Partially correct 56 ms 208 KB Output is partially correct: Maximum length of a query = 97
12 Partially correct 62 ms 284 KB Output is partially correct: Maximum length of a query = 150
13 Partially correct 62 ms 208 KB Output is partially correct: Maximum length of a query = 106