线段树+二分 E. Mark and Professor Koro

VIP文章 haniwn

于 2022-09-29 20:47:40 发布

阅读量218

点赞数

分类专栏：比赛题解文章标签： c++ 算法开发语言

本文链接：https://blog.csdn.net/m0_51731088/article/details/127029771

版权

在这里插入图片描述

// Problem: E. Mark and Professor Koro
// Contest: Codeforces - Codeforces Round #807 (Div. 2)
// URL: https://codeforces.com/contest/1705/problem/E
// Memory Limit: 256 MB
// Time Limit: 2000 ms

#include<bits/stdc++.h>
using namespace std;
#define ios ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
#define fi first
#define se second
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> PII;
typedef vector<int> VI;
inline ll qmi(int a, int b, int p){
    ll res = 1 % p; while (b){
    if (b & 1) res = res * a % p; a = a * (ll)a % p; b >>= 1;} return res;}
inline ll qm(ll a, ll b){
    ll res = 1 ; while (b){
    if (b & 1) res = res * a ; a = a * (ll)a ; b >>= 1;} return res;}
inline ll gcd(ll a,ll b) {
    return b?gcd(b,a%b):a;}
inline ll lcm(ll x, ll y) {
    return x / gcd(x, y) * y