oj.uz

답안 #83318

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
83318 2018-11-06T23:11:43 Z josiftepe Timovi (COCI18_timovi) C++14
10 / 80
 34 ms 1700 KB 
#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 = 2e5 + 10;
int n, k, m;
int ret[maxn];
int main(int argc, const char * argv[]) {
    ios_base::sync_with_stdio(false);

    cin >> n >> k >> m;
    memset(ret, 0, sizeof ret);
    int i = 0;
    bool R = true;
    while(m > 0){
        if(m < k){
            k = m;
        }
        if(R){
            ret[i] += k;
            i ++;
            if(i == n){
                i = n - 1;
                R = false;
            }
            m %= k;
        }
        else{
            ret[i] += k;
            i --;
            if(i == -1){
                i = 0;
                R = true;
            }
            m %= k;
        }
    }
    for(int i = 0; i < n; i ++){
        cout << ret[i] << " ";
    }
    return 0;
}

Subtask #1
10.0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 1144 KB Output isn't correct
2 Incorrect 3 ms 1224 KB Output isn't correct
3 Incorrect 34 ms 1568 KB Output isn't correct
4 Correct 18 ms 1568 KB Output is correct
5 Incorrect 3 ms 1568 KB Output isn't correct
6 Incorrect 3 ms 1568 KB Output isn't correct
7 Incorrect 19 ms 1672 KB Output isn't correct
8 Incorrect 17 ms 1700 KB Output isn't correct