oj.uz

답안 #156226

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
156226 2019-10-04T15:24:32 Z nikolapesic2802 수열 (BOI14_sequence) C++14
0 / 100
 276 ms 504 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;}

int sol=INT_MAX;
vector<int> pwr,em(10);
void gen(vector<vector<int> > req,int digit,int trsol)
{
    if(digit>5)
        return;
    bool done=1;
    for(auto p:req)
        for(auto q:p)
            if(q)
                done=0;
    if(done)
    {
        sol=min(sol,trsol);
        return;
    }
    int n=req.size();
    for(int y=0;y<10;y++)
    {
        vector<vector<int> > sl;
        if(y)
            sl.pb(em);
        int tr=y;
        for(auto p:req)
        {
            if(tr==0)
                sl.pb(em);
            for(int i=0;i<10;i++)
                if(i!=tr&&p[i])
                    sl.back()[i]=1;
            tr=(tr+1)%10;
        }
        gen(sl,digit+1,trsol+pwr[digit]*y);
    }
}
int main()
{
	pwr.pb(1);
	for(int i=0;i<8;i++)
        pwr.pb(pwr.back()*10);
    int n,a;
    scanf("%i",&n);
    vector<vector<int> > req;
    for(int i=0;i<n;i++)
        scanf("%i",&a),em[a]=1,req.pb(em),em[a]=0;
    gen(req,0,0);
    printf("%i\n",sol);
    return 0;
}

Compilation message

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

Subtask #1
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 250 ms 256 KB Output is correct
2 Correct 273 ms 504 KB Output is correct
3 Correct 269 ms 376 KB Output is correct
4 Incorrect 271 ms 388 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 250 ms 364 KB Output is correct
2 Correct 272 ms 424 KB Output is correct
3 Correct 276 ms 380 KB Output is correct
4 Incorrect 271 ms 392 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 152 ms 376 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 250 ms 256 KB Output is correct
2 Correct 272 ms 424 KB Output is correct
3 Correct 269 ms 380 KB Output is correct
4 Incorrect 272 ms 376 KB Output isn't correct
5 Halted 0 ms 0 KB -