CodeForces D. Walking Between Houses

Posted 2021-01-15 zlrrrr

http://codeforces.com/contest/1015/problem/D

 

There are $\mathrm{nn houses\; in\; a\; row.\; They\; are\; numbered\; from 11 to nn in\; order\; from\; left\; to\; right.\; Initially\; you\; are\; in\; the\; house 11.}$

You have to perform $\mathrm{kk moves\; to\; other\; house.\; In\; one\; move\; you\; go\; from\; your\; current\; house\; to\; some\; other\; house.\; You\; can‘t\; stay\; where\; you\; are\; (i.e.,\; in\; each\; move\; the\; new\; house\; differs\; from\; the\; current\; house).\; If\; you\; go\; from\; the\; house xx to\; the\; house yy,\; the\; total\; distance\; you\; walked\; increases\; by |x?y||x?y| units\; of\; distance,\; where |a||a| is\; the\; absolute\; value\; of aa.\; It\; is\; possible\; to\; visit\; the\; same\; house\; multiple\; times\; (but\; you\; can‘t\; visit\; the\; same\; house\; in\; sequence).}$

Your goal is to walk exactly $\mathrm{ss units\; of\; distance\; in\; total.}$

If it is impossible, print "NO". Otherwise print "YES" and any of the ways to do that. Remember that you should do exactly $\mathrm{kk moves.}$

Input

The first line of the input contains three integers $\mathrm{nn, kk, ss (2\le n\le 1092\le n\le 109, 1\le k\le 2?1051\le k\le 2?105, 1\le s\le 10181\le s\le 1018)\; —\; the\; number\; of\; houses,\; the\; number\; of\; moves\; and\; the\; total\; distance\; you\; want\; to\; walk.}$

Output

If you cannot perform $\mathrm{kk moves\; with\; total\; walking\; distance\; equal\; to ss,\; print\; "NO".}$

Otherwise print "YES" on the first line and then print exactly $\mathrm{kk integers hihi (1\le hi\le n1\le hi\le n)\; on\; the\; second\; line,\; where hihi is\; the\; house\; you\; visit\; on\; the ii-th\; move.}$

For each $\mathrm{jj from 11 to k?1k?1 the\; following\; condition\; should\; be\; satisfied: hj\ne hj+1hj\ne hj+1.\; Also h1\ne 1h1\ne 1 should\; be\; satisfied.}$

Examples

input

Copy

10 2 15

output

Copy

YES
10 4 

input

Copy

10 9 45

output

Copy

YES
10 1 10 1 2 1 2 1 6 

input

Copy

10 9 81

output

Copy

YES
10 1 10 1 10 1 10 1 10 

input

Copy

10 9 82

output

Copy

NO

代码：

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
ll N, K, S;

int main() {
    cin >>N >> K >> S;
    if((N - 1) * K < S || S < K) {
        printf("NO
");
        return 0;
    }

    printf("YES
");
    int st = 1;
    while(K --) {
        int dis = min(S - K, N - 1);
        S -= dis;
        if(st + dis <= N) st += dis;
        else st -= dis;
        printf("%d ", st);
    }
    printf("
");
    return 0;
}

　　

以上是关于CodeForces D. Walking Between Houses的主要内容，如果未能解决你的问题，请参考以下文章

Diagonal Walking v.2 CodeForces - 1036B （思维，贪心）

CodeForces - 1015 D.Walking Between Houses

Codeforces 1154D - Walking Robot - [贪心]

codeforces 979C Kuro and Walking Route

Codeforces 1036B Diagonal Walking v.2 贪心

CodeForces 327E Axis Walking(状压DP+卡常技巧)