Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- const int MAXN=1000005;
- int tab[MAXN];
- void f(long long int n,long long int m,long long int k,long long int x,long long int y){
- long long int wyn1=0,wyn2=0,wyn3=0;
- if(n==1){
- wyn1=k/m; wyn2=wyn1; wyn3=wyn1;
- if(k%m) wyn1++;
- if(k%m>=y) wyn3++;
- printf("%lld %lld %lld",wyn1,wyn2,wyn3);
- return;
- }
- if(k>2*(n-1)*m){
- long long int a=k/(2*(n-1)*m);
- wyn2=a;
- wyn1=2*a;
- if(x==1 || x==n) wyn3=wyn2;
- else wyn3=wyn1;
- k%=(2*(n-1)*m);
- }
- long long int a=k/m;
- long long int b=k%m;
- if(a<n && k){
- wyn1++;
- if(x<=a+1 && y<=b) wyn3++;
- }
- if(a>=n){
- wyn2++;
- if(a>n || b) wyn1+=2;
- else wyn1++;
- if(a>n && n+(n-x)<=a+1 && y<=b) wyn3+=2;
- else wyn3++;
- }
- printf("%lld %lld %lld",wyn1,wyn2,wyn3);
- }
- int main(){
- long long int n,m,k,x,y;
- scanf("%lld %lld %lld %lld %lld",&n,&m,&k,&x,&y);
- f(n,m,k,x,y);
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement