oj.uz

답안 #624481

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
624481 2022-08-08T10:33:13 Z Do_you_copy Kotrljanje (COCI18_kotrljanje) C++17
0 / 140
 414 ms 15200 KB 
#include <bits/stdc++.h>
#define taskname "test"
#define fi first
#define se second
#define pb push_back
#define faster ios_base::sync_with_stdio(0); cin.tie(0);
using namespace std;
using ll = long long;
using ull = unsigned ll;
using ld = long double;
using pii = pair <int, int>;
using pil = pair <int, ll>;
using pli = pair <ll, int>;
using pll = pair <ll, ll>;
mt19937 Rand(chrono::steady_clock::now().time_since_epoch().count());

ll min(const ll &a, const ll &b){
    return (a < b) ? a : b;
}

ll max(const ll &a, const ll &b){
    return (a > b) ? a : b;
}

//const ll Mod = 1000000007;
//const ll Mod2 = 999999999989;
//only use when required
const int maxN = 5001 + 1;

int n;
int c, d, b, m;
vector <ll> cnt[maxN];

inline ll sumdigit(ll u){
    if (u < b) return u;
    return sumdigit(u / b) + u % b;
}

void Init(){
    cin >> c >> d >> b >> m;
    int pivot;
    for (int i = 0; ; ++i){
        ll _ = i * (b - 1);
        ll tem = c * _ + d;
        ll sum = sumdigit(tem);
        if (sum % (b - 1) != 0){
            cout << i << " ";
            assert(false);
        }
        if (i >= 1e8) cout << "TLE:",assert(0);
        cnt[sum / (b - 1)].pb(tem);
        if (cnt[sum / (b - 1)].size() == m){
            pivot = sum / (b - 1);
            break;
        }
    }
    for (ll i: cnt[pivot]) cout << i << " ";
}

signed main(){
    if (fopen(taskname".inp", "r")){
        freopen(taskname".inp", "r", stdin);
        //freopen(taskname".out", "w", stdout);
    }
    faster;
    ll tt = 1;
    //cin >> tt;
    while (tt--){
        Init();
    }

    if (fopen("timeout.txt", "r")){
        ofstream testout("timeout.txt");
        testout << double(clock()) / CLOCKS_PER_SEC;
        cerr << "\nTime elapsed: " << double(clock()) / CLOCKS_PER_SEC << "ms\n";
    }
}

Compilation message

kotrljanje.cpp: In function 'void Init()':
kotrljanje.cpp:52:39: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   52 |         if (cnt[sum / (b - 1)].size() == m){
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~
kotrljanje.cpp: In function 'int main()':
kotrljanje.cpp:62:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   62 |         freopen(taskname".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 724 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 724 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 724 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 724 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #5
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 704 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #6
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 724 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 14 ms 1364 KB numbers not having same digit sum in base B
2 Halted 0 ms 0 KB -

Subtask #8
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 414 ms 15200 KB numbers not having same digit sum in base B
2 Halted 0 ms 0 KB -

Subtask #9
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 724 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #10
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 696 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -