oj.uz

Submission #252333

# Submission time Handle Problem Language Result Execution time Memory
252333 2020-07-25T10:00:42 Z leaked Kotrljanje (COCI18_kotrljanje) C++14
42 / 140
 2000 ms 2424 KB 
#include<bits/stdc++.h>
using namespace std;
#include<ext/pb_ds/assoc_container.hpp>
//#include<ext/pb_ds/tree_policy.hpp>
//
//    #pragma GCC optimize("unroll-loops")
//    #pragma GCC optimize("Ofast")
//    #pragma GCC optimize("-O3")
//    #pragma GCC optimize("no-stack-protector")
//    #pragma GCC optimize("fast-math")
//#define LOCAL
#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
  enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c* x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifndef LOCAL
~debug() { cerr << endl; }
eni(!=) cerr << boolalpha << i; ris; }
eni(==) ris << range(begin(i), end(i)); }
sim, class b dor(pair < b, c > d) {
  ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
  *this << "[";
  for (auto it = d.b; it != d.e; ++it)
	*this << ", " + 2 * (it == d.b) << *it;
  ris << "]";
}
#else
sim dor(const c&) { ris; }
#endif
};
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
#define fi first
#define f first
#define se second
#define s second
#define vi_a vector<int>a;
#define p_b push_back
////////////////////////////////???????????????CHECK THIS OUT???????????????//////////////////////////////
#define ll long long
typedef unsigned long long ull;
////////////////////////////////???????????????CHECK THIS OUT???????????????//////////////////////////////
#define ld long double
#define pll pair<ll,ll>
#define pii pair<int,int>
#define m_p make_pair
#define fast_io cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(0);
#define all(x) x.begin(),x.end()
#define getfiles    ifstream cin("input.txt");ofstream cout("output.txt");
#define pw(x) (1ll << x)
#define sz(x) (int)x.size()
#define endl "\n"
#define rall(x) x.rbegin(),x.rend()
#define len(a) (ll)a.size()
#define rep(x,l,r) for(ll x=l;x<r;x++)

using namespace __gnu_pbds;
ld eps = (ld)1 / 1e6;
const ld pi=3.14159265359;
ll inf = 1e18,mod1=1e9+7;
ll sqr(ll a) { return a * a; }
ll qb(ll a) { return a * a * a; }
ll gcd(ll a, ll b) { return !a ? b : gcd(b % a, a); }
ll binpow(ll a, ll b, ll mod) { return b ? (b % 2 ? (a * (sqr(binpow(a, b / 2, mod)) % mod)) % mod : sqr(binpow(a, b / 2, mod)) % mod) : 1; }
ll binmult(ll a, ll b, ll mod) { return b ? (b % 2 ? (2 * binmult(a, b / 2, mod) + a) % mod : (2 * binmult(a, b / 2, mod)) % mod) : 0; }
/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
const ll R=1e4;
const ll tx[4]={0,0,-1,1};
const ll ty[4]={-1,1,0,0};
const char rev_to[4]={'E','W','N','S'};
const int N=5e3+1;
const int M=1e9+7;
//typedef tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update> st;
auto rnd=bind(uniform_int_distribution<ll>(1,125),mt19937(time(0)));
void bad(){
    cout<<-1;
    exit(0);
}
gp_hash_table<int,int>gp;
int c,d,b,m;
int to(ll a,int nmb){
    int s=0;
    string lol;
    while(a){
        s+=a%b;
//        cout<<a%b;
        lol+=char((a%b)+'0');
        a/=b;
    }
    reverse(all(lol));
//    cout<<lol<<endl;
    return s;
}
signed main()
{
    fast_io;
    cin>>c>>d>>b>>m;
    ll f=d+c;
    int cur=1;
    ll need;
    while(1){
        int t=to(f,cur);
        gp[t]++;
//        debug()<<imie(t)<<imie(cur)<<imie(f);
//         cout<<endl;
        if(gp[t]==m){
            need=t;
            break;
        }
        f+=c;
        cur++;
    }
    cur=1;f=d+c;
    while(1){
        int t=to(f,cur);
        if(t==need ){
            if(!m)break;
            cout<<cur<<' ';
            m--;
        }
        f+=c;
        cur++;
    }
    return 0;
}
/*
2*2+1=5
2*11+1=23
2*20+1=41
/
*/

Subtask #1
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 826 ms 760 KB Output is correct
2 Execution timed out 2092 ms 512 KB Time limit exceeded

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2068 ms 384 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2091 ms 504 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2075 ms 768 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 14.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2080 ms 768 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 14.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2086 ms 512 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #7
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 61 ms 384 KB Output is correct
2 Correct 780 ms 1024 KB Output is correct

Subtask #8
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1742 ms 1784 KB Output is correct
2 Correct 997 ms 2168 KB Output is correct
3 Correct 1999 ms 2168 KB Output is correct

Subtask #9
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 831 ms 2424 KB Output is correct
2 Correct 874 ms 2180 KB Output is correct
3 Correct 1118 ms 2392 KB Output is correct

Subtask #10
0 / 14.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2081 ms 504 KB Time limit exceeded
2 Halted 0 ms 0 KB -