oj.uz

Submission #239090

# Submission time Handle Problem Language Result Execution time Memory
239090 2020-06-14T10:57:41 Z Vimmer Kotrljanje (COCI18_kotrljanje) C++14
42 / 140
 761 ms 65540 KB 
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-O3")
#pragma GCC optimize("Ofast")
//#pragma GCC optimize("fast-math")
//#pragma GCC optimize("no-stack-protector")

#define F first
#define S second
#define sz(x) int(x.size())
#define pb push_back
#define N 101001
#define M ll(1e9 + 7)
#define inf 1e9 + 1e9

using namespace std;
//using namespace __gnu_pbds;

typedef long double ld;
typedef long long ll;
typedef short int si;
typedef array <int, 3> a3;

//typedef tree <int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;




unordered_map <ll, vector <int> > koler;

int main()
{
    //freopen("input.txt", "r", stdin); //freopen("output4.txt", "w", stdout);

    ios_base::sync_with_stdio(0); istream::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    ll c, b, d, m;

    cin >> c >> d >> b >> m;

    for (ll i = 1; ; i++)
    {
        ll val = i * c + d;

        ll sum = 0;

        while (val > 0)
        {
            sum += val % b;

            val /= b;
        }

        koler[sum].pb(i);

        if (sz(koler[sum]) == m)
        {
            for (auto it : koler[sum]) cout << it << " ";

            exit(0);
        }
    }
}

Subtask #1
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 479 ms 55160 KB Output is correct
2 Runtime error 665 ms 65536 KB Execution killed with signal 9 (could be triggered by violating memory limits)

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Runtime error 694 ms 65540 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Runtime error 677 ms 65540 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Runtime error 761 ms 65536 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #5
0 / 14.0

# Verdict Execution time Memory Grader output
1 Runtime error 649 ms 65540 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #6
0 / 14.0

# Verdict Execution time Memory Grader output
1 Runtime error 685 ms 65540 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #7
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 768 KB Output is correct
2 Correct 191 ms 4316 KB Output is correct

Subtask #8
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 422 ms 8412 KB Output is correct
2 Correct 269 ms 9288 KB Output is correct
3 Correct 481 ms 9260 KB Output is correct

Subtask #9
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 319 ms 21196 KB Output is correct
2 Correct 235 ms 7292 KB Output is correct
3 Correct 478 ms 40464 KB Output is correct

Subtask #10
0 / 14.0

# Verdict Execution time Memory Grader output
1 Runtime error 695 ms 65540 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -