# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1031430 | 2024-07-22T20:29:22 Z | 7again | Timovi (COCI18_timovi) | C++17 | 744 ms | 3160 KB |
#include <bits/stdc++.h> #define int long long #define endl "\n" #define f first #define s second #define pb push_back #define in insert #define all(x) x.begin(),x.end() #define rall(x) x.rbegin(),x.rend() #define yes cout<<"Yes\n" #define no cout<<"No\n" #define FAST ios::sync_with_stdio(0);cout.tie(0);cin.tie(0) using namespace std ; void setIO(string s){freopen((s+".in").c_str(),"r",stdin);freopen((s+".out").c_str(),"w",stdout);} const int N = 300000 , MOD = 1e9+7 ; //bool inside(int x,int y){return(x<n&&y<m&&x>-1&&y>-1&&a[x][y]!='#');} //int dx[4]{1 , -1 , 0 , 0} , dy[4]{0 , 0 , 1 , -1} ; void slv() { int n , m , k ; cin >> n >> m >> k ; if(k / m < n) { for(int i = 0 ; i < k / m ; i++) cout << m << " " ; cout << k % m << " " ; for(int i = k / m + 1 ; i < n ; i++) cout << 0 << " " ; return ; } int pfx[n + 1] ; fill(pfx , pfx + n + 1 , 0) ; pfx[0] += m ; pfx[n] -= m ; k -= (n * m) ; bool ok = false ; while(k) { if(ok) { if(k >= n - 1) { pfx[1]++ ; k -= n - 1 ; } else { pfx[1]++ ; pfx[k + 1]-- ; k = 0 ; } ok = false ; } else { if(k >= n - 1) { pfx[0]++ ; pfx[n - 1]-- ; k -= n - 1 ; } else { pfx[n - 1]-- ; pfx[n - k - 1]++ ; k = 0 ; } ok = true ; } } for(int i = 1 ; i < n ; i++) pfx[i] += pfx[i - 1] ; for(int i = 0 ; i < n ; i++) cout << pfx[i] << " " ; } main() { //setIO("lasers") ; FAST ; int t = 1 ; //cin >> t ; while(t--) slv() ; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 348 KB | Output is correct |
2 | Incorrect | 0 ms | 348 KB | Output isn't correct |
3 | Correct | 8 ms | 728 KB | Output is correct |
4 | Correct | 8 ms | 732 KB | Output is correct |
5 | Correct | 123 ms | 348 KB | Output is correct |
6 | Correct | 744 ms | 444 KB | Output is correct |
7 | Incorrect | 16 ms | 2908 KB | Output isn't correct |
8 | Incorrect | 10 ms | 3160 KB | Output isn't correct |