首页 > 代码库 > Codeforces Round #284 (Div. 2) a
Codeforces Round #284 (Div. 2) a
/** * @brief Codeforces Round #284 (Div. 2) a * @file a.cpp * @author mianma * @created 2014/12/26 11:51 * @edited 2014/12/18 11:51 * @type brute * @note */ #include <fstream> #include <iostream> #include <cstring> using namespace std; #define max(a, b) ((a) > (b) ? (a) : (b)) #define min(a, b) ((a) > (b) ? (b) : (a)) #define abs(a) ((a) > 0 ? (a) : (0 - (a))) #define CLR(vec) memset(vec, 0, sizeof(vec)) #ifdef DEBUG ifstream in; ofstream out; #define CIN in #define COUT out #else #define CIN cin #define COUT cout #endif #define MAXN 50 #define MAXV 1e5 int n, x; int curr, ans, lft, rht; int main(void){ ios_base::sync_with_stdio(0); #ifdef DEBUG CIN.open("./in", ios::in); COUT.open("./out", ios::out); #endif CIN >> n >> x; int curr = 1; int ans = 0; for(int i = 0; i < n; i++){ CIN >> lft >> rht; if(curr > lft) lft = curr; ans += (lft - curr)%x + rht - lft + 1; curr = rht + 1; } COUT << ans << "\n"; return 0; }
Codeforces Round #284 (Div. 2) a
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。