oj.uz

답안 #571869

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
571869 2022-06-03T01:39:12 Z zaneyu Hidden Sequence (info1cup18_hidden) C++14
100 / 100
 8 ms 336 KB 
#include "grader.h"
#include<bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<long long,null_type,less_equal<long long>,rb_tree_tag,tree_order_statistics_node_update> indexed_set;
#pragma GCC optimize("Ofast")
//#pragma GCC target("avx2")
//order_of_key #of elements less than x
// find_by_order kth element
using ll=long long;
using ld=long double;
using pii=pair<int,int>;
#define f first
#define s second
#define pb push_back
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define FILL(n,x) memset(n,x,sizeof(n))
#define ALL(_a) _a.begin(),_a.end()
#define sz(x) (int)x.size()
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()),c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
const ll maxn=5e5+5;
const ll maxlg=__lg(maxn)+2;
const ll INF64=4e18;
const int INF=0x3f3f3f3f;
const int MOD=1e9+7;
const ld PI=acos(-1);
const ld eps=1e-6;
#define lowb(x) x&(-x)
#define MNTO(x,y) x=min(x,(__typeof__(x))y)
#define MXTO(x,y) x=max(x,(__typeof__(x))y)
template<typename T1,typename T2>
ostream& operator<<(ostream& out,pair<T1,T2> P){
    out<<P.f<<' '<<P.s;
    return out;
}
template<typename T>
ostream& operator<<(ostream& out,vector<T> V){
    REP(i,sz(V)) out<<V[i]<<((i!=sz(V)-1)?"\n":"");
    return out;
}
vector<int> findSequence (int n){
    int half=n/2+1;
    vector<int> v;
    int x=0,y=1;
    int cx=0,cy=0;
    REP(i,half){
        v.pb(x);
        if(!isSubsequence(v)){
            break;
        }
        ++cx;
    }
    v.clear();
    REP(i,half){
        v.pb(y);
        if(!isSubsequence(v)){
            break;
        }
        ++cy;
    }
    if(cx>cy){
        swap(x,y),swap(cx,cy);
    }
    cy=n-cx;
    //cout<<x<<' '<<y<<' '<<cx<<' '<<cy<<'\n';
    int px=0,py=0;
    vector<int> ans;
    REP(i,n){
        if(sz(ans) and ans.back()==y){
            if(px+cy-py<=n/2){
                vector<int> vv;
                REP(i,px+1) vv.pb(x);
                REP(i,cy-py) vv.pb(y);
                if(!isSubsequence(vv)) ans.pb(y);
                else ans.pb(x);
            }
            else{
                vector<int> vv;
                REP(i,py+1) vv.pb(y);
                REP(i,cx-px) vv.pb(x);
                if(isSubsequence(vv)) ans.pb(y);
                else ans.pb(x);
            }
        }
        else{
            vector<int> vv;
            REP(i,px) vv.pb(x);
            vv.pb(y);
            REP(i,cx-px) vv.pb(x);
            if(isSubsequence(vv)) ans.pb(y);
            else ans.pb(x);
        }
        if(ans.back()==x) ++px;
        else ++py;
    }
    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
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct: Maximum length of a query = 5
2 Correct 1 ms 208 KB Output is correct: Maximum length of a query = 6
3 Correct 0 ms 208 KB Output is correct: Maximum length of a query = 5
4 Correct 1 ms 208 KB Output is correct: Maximum length of a query = 5
5 Correct 1 ms 208 KB Output is correct: Maximum length of a query = 4

Subtask #2
80.0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 336 KB Output is correct: Maximum length of a query = 83
2 Correct 7 ms 208 KB Output is correct: Maximum length of a query = 90
3 Correct 6 ms 208 KB Output is correct: Maximum length of a query = 96
4 Correct 7 ms 304 KB Output is correct: Maximum length of a query = 77
5 Correct 7 ms 208 KB Output is correct: Maximum length of a query = 95
6 Correct 7 ms 300 KB Output is correct: Maximum length of a query = 87
7 Correct 5 ms 208 KB Output is correct: Maximum length of a query = 97
8 Correct 6 ms 296 KB Output is correct: Maximum length of a query = 83
9 Correct 6 ms 208 KB Output is correct: Maximum length of a query = 101
10 Correct 6 ms 304 KB Output is correct: Maximum length of a query = 100
11 Correct 6 ms 208 KB Output is correct: Maximum length of a query = 96
12 Correct 8 ms 208 KB Output is correct: Maximum length of a query = 100
13 Correct 6 ms 208 KB Output is correct: Maximum length of a query = 101