| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1031462 | 7again | Timovi (COCI18_timovi) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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) ;
int x = (k / (n - 1)) ;
int a = (x / 2) + (x % 2 != 0) ;
if(x / 2 == 0)
a = 0 ;
int b = x / 2 ;
pfx[0] += a ;
pfx[n - 1] -= a ;
pfx[1] += b ;
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() ;
}
#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) ;
int x = (k / (n - 1)) ;
int a = (x / 2) + (x % 2 != 0) ;
if(x / 2 == 0)
a = 0 ;
int b = x / 2 ;
pfx[0] += a ;
pfx[n - 1] -= a ;
pfx[1] += b ;
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() ;
}