oj.uz

답안 #156242

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
156242 2019-10-04T16:08:07 Z nikolapesic2802 수열 (BOI14_sequence) C++14
100 / 100
 428 ms 1392 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>

#define ll long long
#define pb push_back
#define sz(x) (int)(x).size()
#define mp make_pair
#define f first
#define s second
#define all(x) x.begin(), x.end()
#define D(x) cerr << #x << " is " << (x) << "\n";

using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template<class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>; ///find_by_order(),order_of_key()
template<class T1, class T2> ostream& operator<<(ostream& os, const pair<T1,T2>& a) { os << '{' << a.f << ", " << a.s << '}'; return os; }
template<class T> ostream& operator<<(ostream& os, const vector<T>& a){os << '{';for(int i=0;i<sz(a);i++){if(i>0&&i<sz(a))os << ", ";os << a[i];}os<<'}';return os;}
template<class T> ostream& operator<<(ostream& os, const set<T>& a) {os << '{';int i=0;for(auto p:a){if(i>0&&i<sz(a))os << ", ";os << p;i++;}os << '}';return os;}
template<class T> ostream& operator<<(ostream& os, const multiset<T>& a) {os << '{';int i=0;for(auto p:a){if(i>0&&i<sz(a))os << ", ";os << p;i++;}os << '}';return os;}
template<class T1,class T2> ostream& operator<<(ostream& os, const map<T1,T2>& a) {os << '{';int i=0;for(auto p:a){if(i>0&&i<sz(a))os << ", ";os << p;i++;}os << '}';return os;}

ll sol=LLONG_MAX,lim=16;
vector<ll> pwr;
void gen(vector<int> req,int digit,ll trsol,bool nula)
{
    if(req.empty())
    {
        if(nula)
            trsol+=pwr[digit];
        sol=min(sol,trsol);
        return;
    }
    if(req.size()==1)
    {
        if(req[0]==1)
            trsol+=pwr[digit+1];
        else
        {
            if(req[0]&1)
            {
                int frst;
                for(int i=9;i>0;i--)
                    if(req[0]&(1<<i))
                        frst=i;
                for(int i=9;i>frst;i--)
                    if(req[0]&(1<<i))
                        trsol+=i*pwr[digit],digit++;
                trsol+=frst*pwr[digit+1];
            }
            else
                for(int i=9;i>0;i--)
                    if(req[0]&(1<<i))
                        trsol+=i*pwr[digit],digit++;
        }
        sol=min(sol,trsol);
        return;
    }
    if(digit>7)
        return;
    int n=req.size();
    for(int y=0;y<10;y++)
    {
        vector<int> sl;
        if(y)
            sl.pb(0);
        int tr=y;
        bool nulaffs=0;
        if(y==0&&(req[0]&1))
            nulaffs=1;
        for(auto p:req)
        {
            if(tr==0)
                sl.pb(0);
            sl.back()|=p&(~(1<<tr));
            tr=(tr+1)%10;
        }
        while(sl.size()&&sl.back()==0)
            sl.pop_back();
        gen(sl,digit+1,trsol+pwr[digit]*y,nulaffs);
    }
}
int main()
{
	pwr.pb(1);
	for(int i=0;i<16;i++)
        pwr.pb(pwr.back()*10);
    int n,a;
    scanf("%i",&n);
    vector<int> req;
    for(int i=0;i<n;i++)
        scanf("%i",&a),req.pb(1<<a);
    gen(req,0,0,0);
    printf("%lld\n",sol);
    return 0;
}

Compilation message

sequence.cpp: In function 'void gen(std::vector<int>, int, long long int, bool)':
sequence.cpp:65:9: warning: unused variable 'n' [-Wunused-variable]
     int n=req.size();
         ^
sequence.cpp: In function 'int main()':
sequence.cpp:93:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%i",&n);
     ~~~~~^~~~~~~~~
sequence.cpp:96:23: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%i",&a),req.pb(1<<a);
         ~~~~~~~~~~~~~~^~~~~~~~~~~~~

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 4 ms 256 KB Output is correct
3 Correct 3 ms 376 KB Output is correct
4 Correct 3 ms 256 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 3 ms 376 KB Output is correct
8 Correct 8 ms 256 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 7 ms 252 KB Output is correct
11 Correct 7 ms 256 KB Output is correct
12 Correct 3 ms 376 KB Output is correct
13 Correct 3 ms 256 KB Output is correct
14 Correct 9 ms 256 KB Output is correct
15 Correct 9 ms 376 KB Output is correct

Subtask #2
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 352 KB Output is correct
2 Correct 5 ms 256 KB Output is correct
3 Correct 3 ms 256 KB Output is correct
4 Correct 3 ms 376 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 8 ms 256 KB Output is correct
8 Correct 3 ms 256 KB Output is correct
9 Correct 8 ms 256 KB Output is correct
10 Correct 2 ms 256 KB Output is correct
11 Correct 7 ms 256 KB Output is correct
12 Correct 7 ms 376 KB Output is correct
13 Correct 7 ms 376 KB Output is correct
14 Correct 3 ms 300 KB Output is correct
15 Correct 3 ms 376 KB Output is correct
16 Correct 8 ms 256 KB Output is correct
17 Correct 9 ms 256 KB Output is correct
18 Correct 3 ms 376 KB Output is correct
19 Correct 4 ms 376 KB Output is correct
20 Correct 8 ms 256 KB Output is correct
21 Correct 4 ms 376 KB Output is correct
22 Correct 9 ms 256 KB Output is correct
23 Correct 8 ms 376 KB Output is correct

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 53 ms 376 KB Output is correct
3 Correct 53 ms 504 KB Output is correct
4 Correct 17 ms 376 KB Output is correct
5 Correct 17 ms 376 KB Output is correct
6 Correct 41 ms 464 KB Output is correct
7 Correct 271 ms 1012 KB Output is correct
8 Correct 175 ms 760 KB Output is correct
9 Correct 381 ms 1284 KB Output is correct
10 Correct 380 ms 1388 KB Output is correct

Subtask #4
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 256 KB Output is correct
2 Correct 5 ms 256 KB Output is correct
3 Correct 3 ms 376 KB Output is correct
4 Correct 3 ms 376 KB Output is correct
5 Correct 194 ms 880 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 8 ms 376 KB Output is correct
9 Correct 3 ms 376 KB Output is correct
10 Correct 8 ms 376 KB Output is correct
11 Correct 383 ms 1284 KB Output is correct
12 Correct 372 ms 1324 KB Output is correct
13 Correct 2 ms 380 KB Output is correct
14 Correct 7 ms 376 KB Output is correct
15 Correct 8 ms 376 KB Output is correct
16 Correct 7 ms 376 KB Output is correct
17 Correct 3 ms 376 KB Output is correct
18 Correct 3 ms 252 KB Output is correct
19 Correct 9 ms 256 KB Output is correct
20 Correct 8 ms 252 KB Output is correct
21 Correct 3 ms 376 KB Output is correct
22 Correct 4 ms 256 KB Output is correct
23 Correct 8 ms 376 KB Output is correct
24 Correct 4 ms 376 KB Output is correct
25 Correct 9 ms 376 KB Output is correct
26 Correct 9 ms 424 KB Output is correct
27 Correct 53 ms 504 KB Output is correct
28 Correct 53 ms 632 KB Output is correct
29 Correct 17 ms 508 KB Output is correct
30 Correct 17 ms 504 KB Output is correct
31 Correct 41 ms 376 KB Output is correct
32 Correct 267 ms 1012 KB Output is correct
33 Correct 175 ms 892 KB Output is correct
34 Correct 377 ms 1264 KB Output is correct
35 Correct 379 ms 1280 KB Output is correct
36 Correct 308 ms 1012 KB Output is correct
37 Correct 411 ms 1264 KB Output is correct
38 Correct 247 ms 884 KB Output is correct
39 Correct 428 ms 1392 KB Output is correct
40 Correct 428 ms 1260 KB Output is correct