CodeForces 289A Polo the Penguin and Segments

最新推荐文章于 2022-05-21 20:11:54 发布

Kim0403

最新推荐文章于 2022-05-21 20:11:54 发布

阅读量943

点赞数

分类专栏： CodeForces

本文链接：https://blog.csdn.net/Kim0403/article/details/52027348

版权

CodeForces 专栏收录该内容

50 篇文章 0 订阅

订阅专栏

The value of a set of segments that consists of n segments [l₁; r₁], [l₂; r₂], ..., [l_n; r_n] is the number of integers x, such that there is integer j, for which the following inequality holds, l_j ≤ x ≤ r_j.

懵逼，上一句题意一直读不懂，并不知道它在说什么……

In one move Polo can either widen any segment of the set 1 unit to the left or 1 unit to the right, that is transform [l; r] to either segment [l - 1; r], or to segment [l; r + 1].

Find the minimum number of moves needed to make the value of the set of Polo's segments divisible by k.

他可以往右加一，可以往左加一，又让整除k

猜测题意大概是求区间和加上几，模k余0.

#include<stdio.h>
#include<iostream>
#include<math.h>
#include<string.h>
#include<iomanip>
#include<stdlib.h>
#include<ctype.h>
#include<algorithm>
#include<deque>
#include<functional>
#include<iterator>
#include<vector>
#include<list>
#include<map>
#include<queue>
#include<set>
#include<stack>
#define CPY(A, B) memcpy(A, B, sizeof(A))
typedef long long LL;
typedef unsigned long long uLL;
const int MOD = 1e9 + 7;
const int INF = 0x3f3f3f3f;
const LL INFF = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-9;
const double OO = 1e20;
const double PI = acos (-1.0);
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
using namespace std;
int n,k,i,ans,x,y;
int main() {
    scanf ("%d%d",&n,&k);
    for (i=1; i<=n; i++) {
        scanf ("%d%d",&x,&y),ans+=y-x+1;
    }
    if (ans%k==0) { puts ("0"); }
    else { printf ("%d",k-ans%k); }
    return 0;
}