text stringlengths 49 983k |
|---|
#include<bits/stdc++.h>
#include<string>
using namespace std;
#define lp(i,n) for(int i=0;i<n;i++)
#define lps(i,j,n) for(int i=j;i<n;i++)
#define fordebug int hoge;cin>>hoge;
#define DEKAI 1000000007;
#define INF (1<<28)
#define int long long
#define double long double
#define floot10 cout<<fixed<<setprecision(10)
#de... |
#include<bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int,int>pint;
typedef vector<int>vint;
typedef vector<pint>vpint;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define reps(i,f,n)... |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define pf push_front
#define mp make_pair
#define fr first
#define sc second
#define Rep(i, n) for ( int i = 0 ; i < (n); i++ )
#define All(v) v.begin(), v.end()
typedef pair<int, int> Pii; typedef pair<int, Pii> Pip;
const int... |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = 1e9;
const ll LINF = 1e18;
int main(void) {
cin.tie(0); ios::sync_with_stdio(false);
int N,m; cin >> N >> m;
vector<int> c(m),d(m);
vector<int> flag(N+1);
for(i... |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,m;
cin >> N >> m;
vector<int> is(N+1,1);
for(int i=0; i<m; i++){ // 500
int c,d;
cin >> c >> d;
if(c < d)
for(int j=c; j<d; j++){ // 1000
is[j] = 3;
}
}
int ans = 0;
for(int i=0; i<=N; i++){
ans += is[i];
}
... |
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <vector>
#include <queue>
#include <numeric>
#include <string>
#include <string.h>
#include <map>
#include <set>
#include <functional>
#include <complex>
#include <stack>
#include <tuple>
#include <array>
using namespace std;
#define FOR(i,a,b) for (... |
#include <bits/stdc++.h>
using namespace std;
namespace {
template<class T> ostream& operator<<(ostream& os, const vector<T>& vs) {
if (vs.empty()) return os << "[]";
os << "[" << vs[0];
for (int i = 1; i < vs.size(); i++) os << " " << vs[i];
return os << "]";
}
int N, M;... |
#include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <cstring>
#include <climits>
#include <cmath>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
typedef long long ll;
ty... |
#include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
template<class T> inline T sqr(T x) {return x*x;}
typedef vector<int> vi;
typedef vector<vi> vvi;
typed... |
/**
In the name of Allah, the Most Gracious, the Most Merciful.
**/
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 3e5 + 5;
pair < int, int > ara[1005];
vector < pair < int, int > > ve;
int n, m, c, d, ans;
int main() {
#ifdef _OFFLINE_
freopen("in.txt", "r", stdin);
#... |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <complex>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <iomanip>
#include <assert.h>
#include <array>
#include <cstdio>
#include <cstring>
#include <random>
... |
//hikaku site donnyoku ni otosu ippanntekina teku
#include <iostream>
using namespace std;
int n, m;
int c[500], d[500];
int imos[1002];
int main() {
cin >> n >> m;
int i;
for (i = 0; i < n + 2; i++) imos[i] = 0;
for (i = 0; i < m; i++) {
cin >> c[i] >> d[i];
imos[c[i]]++;
imos[d[i]]--;
}
for (i = 1; i < ... |
#include <iostream>
#include <vector>
#include <string>
#include <cstdlib>
#include <stack>
using namespace std;
int n,m;
int a[1050];
int main()
{
for (int i = 0; i < 1050; i++)
a[i]=-1;
cin>>n>>m;
for (int i = 0; i < m; i++){
int c,d;
cin>>c>>d;
a[c]=std::max(d,a[c]);
}
long long dist=0;
for (int i = 0;... |
#include <bits/stdc++.h>
#define REP(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
int main() {
int n,m;
cin>>n>>m;
vector<int> rev(n+2);
REP(i,m) {
int c,d;
cin>>c>>d;
for(int j=c;j<d;++j) rev[j]=1;
}
cout<<(n+1+count(begin(rev),end(rev),1)*2)<<endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
const double eps = 1e-10;
const int MOD = 1000000007;
const int INF = 1000000000;
const ll LINF = 1ll<<50;
templ... |
#include<cstdio>
#include<vector>
#include<iostream>
#include<algorithm>
#include<string>
using namespace std;
#define reps(i,f,n) for(int i=f;i<int(n);i++)
#define rep(i,n) reps(i,0,n)
const int N = 1111;
int main(){
int n,k;
cin>>n>>k;
int masu[N]={0};
rep(i,k){
int a,b;
cin>>a>>b;
reps(j,a,b){
... |
#include<iostream>
#include<cstdio>
#include<string>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
const ll... |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
#define all(c) c.begin(),c.end()
#define pb push_back
#define fs first
#define sc second
#define show(x) cout << #x << " = " << x << endl
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
using... |
#include<bits/stdc++.h>
#define long long long
using namespace std;
const int N=1e3;
const int inf=1e6;
int rq[N+2],mn,vis[N+2];
vector<int>adj[N+2];
void dfs(int node)
{
mn=min(mn,node);
if(vis[node])return ;
vis[node]=1;
for(auto x:adj[node])
dfs(x);
}
int main()
{
ios_base::sync_with_stdio(0);cin.tie(0... |
#include <iostream>
#include <algorithm>
#define N 1001
using namespace std;
int main(){
int n,m,c,d,l,r,flag,sum;
int V[N]={0};
cin >> n >> m;
for(int i=0;i<m;i++) cin >> c >> d,V[c]=max(V[c],d);
l=r=flag=sum=0;
for(int i=0;i<=n;i++){
if(flag&&V[i]!=0) r=max(r,V[i]);
if(V[i]!=0&&!flag) l=i,r=V[i],f... |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
#define rep(i,x,y) for(int i=(x);i<y;i++)
struct S {
int c, d;
};
int main()
{
int N, m;
cin >> N >> m;
vector<S> data(m);
rep(i, 0, m) {
cin >> data[i].c >> data[i].d;
}
while (true) {
bool flag = false;
rep(i, 0, m) {
... |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N, m;
cin >> N >> m;
vector<pair<int, int>> cd(m);
int c, d;
for(int i = 0; i < m; i++){
cin >> c >> d;
cd[i] = make_pair(c, d);
}
sort(cd.begin(), cd.end());
int ans = N + 1;
int start = 0;
int end = 0;
for(int i = 0; i < ... |
#include <bits/stdc++.h>
#define REP(i,n) for(int i=0; i<(int)(n); ++i)
using namespace std;
typedef long long LL;
int main(){
int L, n;
while(cin >> L >> n) {
vector<pair<int, int>> vp(n);
REP(i, n) {
int a, b;
cin >> a >> b;
vp[i] = make_pair(a, b);
... |
#include <bits/stdc++.h>
#define syosu(x) fixed<<setprecision(x)
using namespace std;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef pair<double,double> pdd;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<double>... |
#include <bits/stdc++.h>
using namespace std;
#define dump(n) cout<<"# "<<#n<<'='<<(n)<<endl
#define repi(i,a,b) for(int i=int(a);i<int(b);i++)
#define peri(i,a,b) for(int i=int(b);i-->int(a);)
#define rep(i,n) repi(i,0,n)
#define per(i,n) peri(i,0,n)
#define all(c) begin(c),end(c)
#define mp make_pair
#define mt make... |
#include<iostream>
#include<cstdio>
#include<string>
#include<cstring>
#include<vector>
#include<set>
#include<list>
#include<queue>
#include<cmath>
#include<functional>
#include<algorithm>
#define INF (1<<29)
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
struct Range{
int s,e;
Range(){}
Range(int s... |
#include <bits/stdc++.h>
using namespace std;
bool arr[1010];
int main(){
int N,M,c,d;
cin >> N >> M;
for(int i = 0 ; i < M ; i++){
cin >> c >> d;
for(int j = c ; j < d ; j++){
arr[j] = true;
}
}
cout << N+2*count(arr,arr+N,1)+1 << endl;
return 0;
} |
#include "bits/stdc++.h"
using namespace std;
int rui[1010];
int main()
{
int n,m;
int ans=0;
cin>>n>>m;
ans+=n+1;
fill(rui,rui+1010,0);
for(int i=0;i<m;i++)
{
int c,d;
cin>>c>>d;
if(c<d)
{
rui[c]++;
rui[d]--;
}
}
for(int i=1;i<1010;i++)
rui[i]=rui[i]+rui[i-1];
//累積和が1以上の区間を見る
int i=0;
... |
#include <bits/stdc++.h>
using namespace std;
#define INF 1001000100010001000
#define MOD 1000000007
#define EPS 1e-10
#define int long long
#define rep(i, N) for (int i = 0; i < N; i++)
#define Rep(i, N) for (int i = 1; i < N; i++)
#define For(i, a, b) for (int i = (a); i < (b); i++)
#define pb push_back
#define eb ... |
#include<iomanip>
#include<limits>
#include<thread>
#include<utility>
#include<iostream>
#include<string>
#include<algorithm>
#include<set>
#include<map>
#include<vector>
#include<stack>
#include<queue>
#include<cmath>
#include<numeric>
#include<cassert>
#include<random>
#include<chrono>
#include<unordered_set>
#includ... |
#include <iostream>
#include <vector>
#define PB push_back
using namespace std;
int main(void)
{
int vis[1024];
int n,m;
cin >> n >> m;
for(int i=0;i<n+5;++i) vis[i]=i;
for(int i=0;i<m;++i){
int left,right;
cin >> left >> right;
if(vis[left]<right)
vis[left]=right;
}
for(int i=0;i<n+5;++... |
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<vector>
#include<stack>
#include<queue>
#include<string>
#include<utility>
//#include<>
using namespace std;
#define rep(i,j) for(i=0;i<j;(i)++)
int main()
{
int N,m;
cin >>N>>m;
int i;
pair<int,int> restricts[500],restricts_d_c[500];//(ci,di)と(... |
#include <bits/stdc++.h>
#define chmin(a, b) ((a)=min((a), (b)))
#define chmax(a, b) ((a)=max((a), (b)))
#define fs first
#define sc second
#define eb emplace_back
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef tuple<int, int, int> T;
const ll MOD=1e9+7;
const ll INF=1e18;
int dx[]={1, ... |
#include <iostream>
#include <stdio.h>
#include <math.h>
#include <vector>
using namespace std;
int n, m;
int l[505], r[505];
int dif[1005], sum[1005];
int main(void)
{
cin >> n >> m;
for(int i = 1; i <= m; i++) cin >> l[i] >> r[i];
for(int i = 1; i <= m; i++){
dif[l[i]]++, dif[r[i]]--;
}
for(int i = ... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
int N, m;
cin >> N >> m;
vector<bool> select(m, true);
vector<pair<int, int>> cd(m);
for (int i = 0; i < m; ++i)
cin >> cd[i].first >> cd[i].second;
sort(cd.begin(), cd.end());
for (int i = 0; i <... |
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
// editorial解
// 重なる区間を1発で済ませてしまえば良いことが自明なので
// いもしてホイ
int n, m;
cin >> n >> m;
int imos[1005] = {};
for(int i = 0; i < m; i++){
int c, d;
cin >> c >> d;
imos[c]++, imos[d]--;
... |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i, n) for(ll (i) = 0; (i) < (n); (i)++)
#define rep1(i, n) for(ll (i) = 1; (i) <= (n); (i)++)
#define rrep(i, n) for(ll (i) = (n) - 1; (i) >= 0; (i)--)
#define rrep1(i, n) for(ll (i) = (n); (i) >= 1; (i)--)
const ll ... |
#include<bits/stdc++.h>
using namespace std;
int main(int argc, char *argv[]){
int n, m;
cin >> n >> m;
int c[m], d[m];
int road[n + 1];
memset(road, 0, sizeof(road));
for (int i = 0; i < m; i++) {
cin >> c[i] >> d[i];
for (int j = c[i]; j < d[i]; j++) {
road[j] = 1;
}
}
int ans = 0;
... |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int dfs(int n, vector<vector<int> >& adj){
if((int)adj[n].size() == 0) return n;
int ret=0;
for(int i=0; i<(int)adj[n].size(); i++){
ret = max(ret, dfs(adj[n][i], adj));
}
adj[n].clear();
return ret;
}
int main(){
int n,m;
cin >... |
// 3.3 ""
// https://onlinejudge.u-aizu.ac.jp/problems/2298
// 所要時間:
// 着席位置: 左前
// 学んだこと:
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
using namespace std;
typedef long long ll;
int main(void){
int n, m;
cin >> n >> m;
vector<pair<int, int>> make;
for (int i = 0;... |
#include <stdio.h>
#pragma warning(disable : 4996)
int n, m, c, d, imos[1111];
int main()
{
scanf("%d", &n);
scanf("%d", &m);
for (int i = 0; i < m; i++)
{
scanf("%d", &c);
scanf("%d", &d);
imos[c--]++;
imos[d--]--;
}
int ret = n + 1, sum = 0;
for (int i = 0; i < n; i++)
{
sum += imos[i];
if... |
// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1347
// ICPC: アジア地区予選2014C
// Shopping
/*
Problem.
スタート地点:0, ゴール地点: N+1であるとして、
地点1~Nに存在するN個あるノードを全て訪れるときの最短距離を求めよ、
ただし、M個の以下の内容の制約が与えられる。
- 制約(C, D)：ノードCの前にノードDを訪れなければならない。
Point.
preceder[i]:iの最も後ろの先行ノード
- preceder[i]より前のiの先行ノードについては、
preceder[i]を訪れる際にコスト... |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N, m;
cin >> N >> m;
bool th[1001] = {false};
for(int i = 0; i < m; i++) {
int c, d; cin >> c >> d;
for(int j = c; j < d; j++) th[j] = true;
}
int ans = N + 1;
for(int i = 0; i < N; i++) {
if(th[i]) ans += 2;
}
cout << ans <<... |
#include <stdio.h>
#include <cmath>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
typedef long long int ll;
#define BIG_NUM 2000000000
using namespace std;
int main(){
int N,M,left,right,ans = 0;
scanf("%d %d",&N,&M);
bool* table = new bool[N+1];
for(int i = 0; i <= N; i++)table[i] = f... |
#include<bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define im imag()
#define re real()
#define r(I, N) for(int I=0;I<N;I++)
#define f(I, A, B) for(int I=A;I<B;I++)
#define fd(I, A, B) for(int I=A;I>=B;I--)
#define ite(x) for(__typeof((x).begin()) it... |
#include <bits/stdc++.h>
using namespace std;
int main(void){
bool a[1001]={};
int N,m,cnt=0;
cin>>N>>m;
while(m--){
int c,d;
cin>>c>>d;//d???c?????????????????????
for(int i=c;i<d;++i)a[i]=true;//d??????c??????????????????
}
for(int i=0;i<=N;++i)if(a[i])cnt++;//?????£??... |
#include<bits/stdc++.h>
#define r(i,n) for(int i=0;i<n;i++)
using namespace std;
int main(){
int n,m,x=0,q,w;
cin>>n>>m;
vector<int>a[n];
r(i,m)cin>>q>>w,
a[q-1].push_back(x),
a[w-1].push_back(x++);
set<int>s;int p=0,st,ans=0;
r(i,n){
if(a[i].size()){
if(!p)p++,st=i;
r(j,a[i].size())... |
#include<iostream>
#include<string>
#include<cstring>
#include<vector>
#include<set>
typedef long long ll;
using namespace std;
typedef vector<int> vi;
int N,m;
int c[505];
int d[505];
bool triple[1005];
int main()
{
memset(triple,false,sizeof(triple));
ll ans=0;
cin >> N >> m;
for(int i=0;i<m;i++)
{
... |
#include <cstdio>
#include <iostream>
#include <string>
#include <sstream>
#include <stack>
#include <algorithm>
#include <cmath>
#include <queue>
#include <map>
#include <set>
#include <cstdlib>
#include <bitset>
#include <tuple>
#include <assert.h>
#include <deque>
#include <bitset>
#include <iomanip>
#include <limit... |
#define _CRT_SECURE_NO_WARNINGS
#pragma comment (linker, "/STACK:526000000")
#include "bits/stdc++.h"
using namespace std;
typedef string::const_iterator State;
#define eps 1e-11L
#define MAX_MOD 1000000007LL
#define GYAKU 500000004LL
#define MOD 998244353LL
#define seg_size 262144*2LL
#define pb push_back
#define ... |
#include <iostream>
using namespace std;
int main(){
int N, m, c, d;
cin >> N >> m;
int imos[N+1];
fill(imos, imos+N+1, 0);
for(int i = 0; i < m; ++i){
cin >> c >> d;
++imos[c];
--imos[d];
}
int t = 0, ans = N+1;
for(int i = 0; i <= N; ++i){
t += imos[i];
if(t > 0) ans += 2;
}
co... |
#include <iostream>
#include <vector>
#include <cstring>
#include <string>
#include <algorithm>
#include <iomanip>
#include <cmath>
#include <cassert>
using namespace std;
typedef pair<int, int> P;
const int INF = 1 << 28;
int dp[510][1010];
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, M;
while(c... |
#include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <cstring>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <algorithm>
using namespace std;
#define REP(i,n) for(int i=0; i<n; ++i)
#define FOR(i,a,b) for(int i=a; i<=b; ++i)
... |
#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <iostream>
#include <math.h>
#include <assert.h>
#include <vector>
#include <queue>
#include <string>
#include <map>
#include <set>
using namespace std;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
static const dou... |
//include
//------------------------------------------
#include <vector>
#include <list>
#include <map>
#include <climits>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <... |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <numeric>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <utility>
#include <sstream>
#include <complex>
#include <fstream>
#include <bitset>
#include ... |
#include <bits/stdc++.h>
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
#define Rep(i,a,b) for(int i=a;i<b;i++)
#define REP(i,a,b) for(int i=a;i<=b;i++)
#define rev(i,n) for(int i=n-1;i>=0;i--)
#define vi vector<int>
#define pb push_back
#define pi pair<int,int>
#define vp vector<pair<int,int> >
#define mp... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,a,b) for(int i=a;i<b;i++)
int main()
{
int N, M;
cin >> N >> M;
map< int, vector<int> > memo;
rep(i, 0, M)
{
int c, d;
cin >> c >> d;
memo[c].push_back(i);
memo[d].push_back(i);
}
ll ans = 0;
set<int> first, second;
in... |
#include <bits/stdc++.h>
using namespace std;
#define LOG(...) fprintf(stderr, __VA_ARGS__)
//#define LOG(...)
#define FOR(i, a, b) for(int i=(int)(a); i<(int)(b); ++i)
#define REP(i, n) for(int i=0; i<(int)(n); ++i)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define EXIST(s, e) ((... |
#include<bits/stdc++.h>
using namespace std;
#define FOR(i,bg,ed) for(int i=bg;i<ed;i++)
#define REP(i,n) FOR(i,0,n)
template<typename T>
bool chmax(T& l,T r){
bool ret = l<r;
if(l<r)l=r;
return ret;
}
template<typename T>
bool chmin(T& l,T r){
bool ret = l>r;
if(l>r)l=r;
return ret;
}
typedef ... |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,M;
bool arr[1010] = {false};
cin >> N >> M;
for(int i = 0 ; i < M ; i++){
int c,d;
cin >> c >> d;
for(int j = c ; j < d ; j++){
arr[j] = true;
}
}
cout << N+2*count(arr,arr+N,true)+1 << endl;
return 0;
} |
#include <iostream>
#include <algorithm>
#define N 1001
using namespace std;
int main(){
int n,m,c,d,l,r,flag,sum;
int V[N]={0};
cin >> n >> m;
for(int i=0;i<m;i++){
cin >> c >> d;
V[c]=max(V[c],d);
}
l=r=0;
flag=sum=0;
for(int i=0;i<=n;i++){
if(flag&&V[i]!=0) r=max(r,V[i]);
else if(flag... |
#include <bits/stdc++.h>
#define sf scanf
#define pf printf
#define pb push_back
#define mp make_pair
#define PI ( acos(-1.0) )
#define pmod 1000000007
#define maxn 100005
#define IN freopen("input.txt","r",stdin)
#define OUT freopen("output.txt","w",stdout)
#define FOR(i,a,b) for(int i=a ; i<=b ; i++)
#define INF 100... |
#include <bits/stdc++.h>
using namespace std;
#define all(c) (c).begin(), (c).end()
int main() {
int N, m; cin >> N >> m;
vector<char> goback(N, 0);
while (m--) {
int c, d; cin >> c >> d;
fill_n(goback.begin() + c, d - c, 1);
}
cout << count_if(all(goback), [&](char c) { return c ==... |
#include <iostream>
#include <vector>
#include <utility>
#include <algorithm>
using namespace std;
int main(void)
{
int N, M;
cin >> N >> M;
vector<pair<int, int>> R(M);
for (auto &i : R) cin >> i.first >> i.second;
sort(R.begin(), R.end());
int ans = 0, now = 0;
int c, d;
for (auto i = R.begin(); i != R.end(... |
#include <bits/stdc++.h>
using namespace std;
int n,m;
int rev[1024]={};
int main(){
cin >> n >> m;
for(int i=0;i<m;++i){
int c,d;
cin >> c >> d;
rev[c]++;
rev[d]--;
}
for(int i=0;i<n;++i) rev[i+1]+=rev[i];
int answer=n+1;
for(int i=0;i<=n;++i) if(rev[i]) answer+=2;
cout << answer << endl;
return 0;
... |
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>
static const int MOD = 1000000007;
using ll = long long;
using u32 = uint32_t;
using namespace std;
template<class T> constexpr T INF = ::nu... |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,s,e) for((i)=(s);(i)<(int)(e);(i)++)
typedef long long ll;
const int N = 1000;
const int M = 500;
int n, m;
int l[M], r[M];
int check[N+2];
int il[M], ir[M];
int main() {
int i, j;
scanf("%d%d ", &n, &m);
for (i=0; i<n; i++)
scanf("%d%d ", l+i, r+i);... |
#include<bits/stdc++.h>
#define REP(x,y,z) for(int x=y;x<=z;x++)
#define FORD(x,y,z) for(int x=y;x>=z;x--)
#define MSET(x,y) memset(x,y,sizeof(x))
#define FOR(x,y) for(__typeof(y.begin()) x=y.begin();x!=y.end();x++)
#define F first
#define S second
#define MP make_pair
#define PB push_back
#define SZ size()
#define M 1... |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n, m; cin >> n >> m;
vector<int> imos(n + 2, 0);
for(int i = 0; i < m; i++){
int c, d; cin >> c >> d;
if(c < d){
imos[c]++;
imos[d]--;
}
}
for(int i = 1; i <= n + 1; i++){
imos[i] +... |
/*************************************************************************
> File Name: 3.cpp
> Author: cy
> Mail: 1002@qq.com
> Created Time: 15/5/13 20:28:00
************************************************************************/
#include<iostream>
#include<cstring>
#include <algorithm>
#include<... |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <queue>
#include <deque>
#include <bitset>
#include <numeric>
#include <sstream>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <tuple>
#include <stack>
using namespace... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
constexpr int IINF = INT_MAX;
void chmin(int &a, int b){a=min(a,b);};
int main() {
int n, m;
cin >> n >> m;
vector<int> a(n+2, n+1);
vector<vector<int> > dp(n+2, vector<int>(n+2, IINF/2));
for(int i=0;i<m;i++){
int c, d;
... |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N, m;
cin >> N >> m;
vector< bool > shop(N + 1, 0);
for(int i = 0; i < m; ++i){
int c, d;
cin >> c >> d;
fill( shop.begin() + c, shop.begin() + d, true);
}
cout << N + 1 + count(shop.begin(), shop.end(), true) * 2 << endl;
} |
#include<bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define ALL(A) A.begin(),A.end()
#define RALL(A) A.rbegin(),A.rend()
typedef long long LL;
typedef pair<int,int> P;
const LL mod=1000000007;
const LL LINF=1LL<<62;
const LL I... |
#include<iostream>
#include<cstdio>
#include<string>
#include<cstring>
#include<vector>
#include<set>
#include<list>
#include<queue>
#include<cmath>
#include<functional>
#include<algorithm>
#define INF (1<<29)
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
struct Range{
int s,e;
Range(){}
Range(int s... |
#include <bits/stdc++.h>
#define rep(i, a, n) for(int i = a; i < n; i++)
using namespace std;
typedef pair<int, int> P;
const int INF = 1e9;
int dp[510], nxt[510];
int main(){
int n, m;
cin >> n >> m;
vector<P> d(m);
rep(i, 0, m){
cin >> d[i].first >> d[i].second;
}
sort(d.begin(), d.e... |
#include <iostream>
#include <fstream>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <stack>
#include <iomanip>
#include <utility>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
int solve(void);
int main(void)
{
while (solve())
{
}... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
int N, m;
int cum[1010];
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(10);
cin >> N >> m;
for (int i = 0; i < m; i++) {
int c, d;
cin >> c >> d;
cum[c]+... |
#define _CRT_SECURE_NO_WARNINGS
#include"bits/stdc++.h"
#ifdef _DEBUG
#define DBG(n) n
#else
#define DBG(n)
#endif
#define INF 1e9
#define INFLL 1e18
#define EPS 1e-9
#define REP(i,n) for(ll i=0,i##_len=(n);i<i##_len;++i)
#define REP1(i,n) for(ll i=1,i##_len=(n);i<=i##_len;++i)
#define REPR(i... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define repp(i, l, r) for(int i = (l); i < (r); i++)
#define per(i, n) for(int i = ((n)-1); i >= 0; i--)
#define perr(i, l, r) for(int i = ((r)-1); i >= (l); i--)
#define all(x) (x).begin(),(x).end()
#define MOD 1000000007
#de... |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; i++)
using namespace std;
int n, m;
int table[2000];
int ans;
int main(){
scanf("%d%d",&n,&m);
ans = n+1;
rep(i,m){
int c, d;
scanf("%d%d",&c,&d);
table[c]++;
table[d]--;
}
for(int i = 1; i < 2000; i++) table[i] += table[i-1];
for(int i = ... |
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> pii;
#define all(c) (c).begin(), (c).end()
#define loop(i,a,b) for(ll i=a; i<ll(b); i++)
#define rep(i,b) loop(i,0,b)
#define pb push_back
#define eb ... |
#include <iostream>
using namespace std;
int N,M;
int r[1010] = {};
int main(){
cin >> N >> M;
int c,d;
for(int i=1;i<=M;i++){
cin >> c >> d;
r[c+1]++; r[d+1]--;
}
for(int i=1;i<=N;i++) r[i] += r[i-1];
int ans = 0;
for(int i=1;i<=N;i++){
if(r[i]>=1) ans += 3;... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define each(itr,c) for(__typeof(c.begin()) itr=c.begin(); itr!=c.end(); ++itr)
#define all(x) (x).begin(),(x).end()
#define mp make_pair
#define pb push_back
#define fi first
#define se second
typed... |
#include <algorithm>
#include <bitset>
#include <cctype>
#include <complex>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include ... |
#include<cstdio>
using namespace std;
bool rev[1010];
int main(){
int n,m,c,d,ans;
scanf("%d%d",&n,&m);
while(m--){
scanf("%d%d",&c,&d);
for(int i=c;i<d;i++) rev[i]=true;
}
ans=n+1;
for(int i=1;i<n;i++) if(rev[i]) ans+=2;
printf("%d\n",ans);
return 0;
} |
#include<stdio.h>
#include<algorithm>
using namespace std;
int p[1100];
int main(){
int a,b;scanf("%d%d",&a,&b);
for(int i=0;i<a;i++){
int c,d;
scanf("%d%d",&c,&d);
for(int i=c;i<d;i++)p[i]++;
}
int ret=a+1;
for(int i=1;i<=a;i++)if(p[i])ret+=2;
printf("%d\n",ret);
} |
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <utility>
#include <cstring>
#include <cmath>
#include <queue>
#include <set>
#include <map>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
typedef long long ll;
typedef pair<int,int> pii;
int main() {
int n, m;
cin ... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
void printv(vector<ll> v) {
for (ll i : v)
cout << i << endl;
}
int main() {
int n, m;
cin >> n >> m;
vector<int> st(n + 1, 1);
rep(... |
#include <bits/stdc++.h>
using namespace std;
const int INF = 1000000000;
#define REP(i,s,n) for(int i=(int)(s);i<(int)(n);++i)
#define rep(i,n) REP(i, 0, n)
typedef long long int i64;
typedef pair<int, int> pint;
int a[1001];
int main() {
int N, M; scanf("%d%d", &N, &M);
int c, d;
memset(a, 0, sizeof(a));
... |
#include <algorithm>
#include <array>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define REP(i, n... |
#include <bits/stdc++.h>
int main() {
int N, m;
int c[2048];
int d[2048];
int imos[2048] = {};
std::cin >> N >> m;
for(int i = 0; i < m; ++i) {
std::cin >> c[i] >> d[i];
}
for(int i = 0; i < m; ++i) {
imos[c[i]] += 1;
imos[d[i]] -= 1;
}
int t = 0;
for(int i = 0; i <= N; ++i) {
... |
#include <cstdio>
#include <algorithm>
using std::sort;
using std::max;
struct shop{
int l, r;
}shops[1000];
int S;
bool comp(shop a, shop b){
return a.l < b.l;
}
int main(){
int N, M;
scanf("%d %d", &N, &M); N++;
while(M--){
int l, r;
scanf("%d %d", &l, &r);
if(l < r){
... |
#include <bits/stdc++.h>
using namespace std;
#define LOG(...) fprintf(stderr, __VA_ARGS__)
//#define LOG(...)
#define FOR(i, a, b) for(int i=(int)(a); i<(int)(b); ++i)
#define REP(i, n) for(int i=0; i<(int)(n); ++i)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define EXIST(s, e) ((... |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m; cin >> n >> m;
vector<pair<int, int>> rng(m);
for (auto &p: rng) cin >> p.first >> p.second, p.first--, p.second--;
rng.emplace_back(0, 0); rng.emplace_back(n, n);
sort(rng.begin(), rng.end());
... |
#include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
template<class T> inline T sqr(T x) {return x*x;}
typedef vector<int> vi;
typedef vector<vi> vvi;
typed... |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N, m;
cin >> N >> m;
vector<int> c(m), d(m);
for (int i = 0; i < m; i++){
cin >> c[i] >> d[i];
}
vector<int> cnt(N + 1, 0);
for (int i = 0; i < m; i++){
for (int j = c[i]; j < d[i]; j++){
cnt[j]++;
}
}
int ans = N + 1;
f... |
#include<bits/stdc++.h>
using namespace std;
typedef pair<int,int> P;
int n,m,a,b;
vector<P> t,u;
vector<P> func(vector<P> t){
sort(t.begin(),t.end());
t.push_back(P(1e9,0));
int size=t.size();
vector<P> res;
for(int i=0;i+1<size;i++){
if(t[i].second<t[i+1].first){
res.push_back(t[i]);
}else{
... |
#include <bits/stdc++.h>
typedef long long LL;
#define SORT(c) sort((c).begin(),(c).end())
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
using namespace std;
int main(void)
{
int n,m;
cin >> n >> m;
int bac[1024]={};
REP(i,m){
int c,d;
cin >> c >> d;
bac[d-1]++;
bac[... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.