oj.uz

답안 #734751

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
734751 2023-05-03T04:08:48 Z vjudge1 Timovi (COCI18_timovi) C++17
70 / 80
 222 ms 11784 KB 
#include <bits/stdc++.h>
#define B begin()
#define E end()
#define F first
#define S second
#define pb push_back
#define pf push_front
#define eb emplace_back
#define ll long long
#define ui unsigned int
#define ull unsigned long long
#define sts stable_sort
using namespace std;

const int MAXN = 1e6 + 4;
const int MOD = 1e9 + 7;

int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0);

    int n, k, m; cin >> n >> k >> m;
    map<int, int> ma;

    if(n * k >= m){
        for(int i = 0; i < n; i++){
            if(m >= k){
                ma[i] += k;
                m -= k;
            }else if(m > 0){
                ma[i] += m;
                m = 0;
            }
        }
        for(int i = 0; i < n; i++){
            cout << ma[i] << " ";
        }cout << "\n";
        return 0;
    }

    m -= n * k;
    int izq = 0, der = 0, rest = (n - 1) * k;
    bool a = 0;

    while(m >= rest){
        m -= rest;
        if(a == 0){
            der += k;
            a = 1;
        }else{
            izq += k;
            a = 0;
        }
    }

    if(a){
        for(int i = 1; m > 0;){
            if(m >= k){
                ma[i] += k;
                m -= k;
            }else{
                ma[i] += m;
                m = 0;
            }
            if(i == n - 1 && a){
                a = 0;
            }else if(i == 0 && !a){
                a = 1;
            }
            if(a)i++;
            else i--;
        }
    }else{
        for(int i = n - 2; m > 0;){
            if(m >= k){
                ma[i] += k;
                m -= k;
            }else{
                ma[i] += m;
                m = 0;
            }
            if(i == n - 1 && a){
                a = 0;
            }else if(i == 0 && !a){
                a = 1;
            }
            if(a)i++;
            else i--;
        }
    }

    for(int i = 0; i < n; i++){
        if(i <= n - 2){
            ma[i] += der;
        }
        if(i >= 1){
            ma[i] += izq;
        }

        cout << ma[i] + k << " ";
    }cout << "\n";

    return 0;
}

Subtask #1
70.0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 54 ms 10068 KB Output is correct
4 Incorrect 94 ms 11784 KB Output isn't correct
5 Correct 60 ms 212 KB Output is correct
6 Correct 222 ms 300 KB Output is correct
7 Correct 87 ms 10680 KB Output is correct
8 Correct 95 ms 10700 KB Output is correct