Submission #83326

#	Time	Username	Problem	Language	Result	Execution time	Memory
83326		josiftepe	Timovi (COCI18_timovi)	C++14	40 / 80	8 ms	5544 KiB

timovi

#include <iostream>
#include <cstring>
#include <vector>
#include <set>
#include <map>
#include <sstream>
#include <cstdio>
#include <algorithm>
#include <stack>
#include <queue>
#include <cmath>
#include <iomanip>
#include <fstream>
//#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = (1 << 30);
const ll inf = (1LL << 60LL);
const int maxn = 3e5 + 10;
ll n, k, m;
ll ret[maxn];
int main(int argc, const char * argv[]) {
    ios_base::sync_with_stdio(false);
//    ifstream cin("in.txt");
    cin >> n >> k >> m;
    ll path_sz = 2 * n - 2;
    ll kids = path_sz * k;
    ll full = m / kids;
    ll rem_groups = (m % kids) / k;
    ll rem_children = (m % kids) % k;
    for(int i = 1; i <= path_sz; i ++){
        ret[i] = full * k;
    }
    for(int i = 1; i <= rem_groups; i ++){
        ret[i] += k;
    }
    ret[rem_groups + 1] += rem_children;
    cout << ret[1] << " ";
    for(int i = 2; i < n; i ++){
        ret[i] += ret[path_sz - i + 2];
        cout << ret[i] << " ";
    }
    cout << ret[n] << endl;
    return 0;
}

• Subtask 1: 40 / 80