text stringlengths 49 983k |
|---|
#define _USE_MATH_DEFINES
#define INF 0x3f3f3f3f
#include <iostream>
#include <cstdio>
#include <sstream>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <queue>
#include <stack>
#include <limits>
#include <map>
#include <string>
#include <cstring>
#include <set>
#include <deque>
#include <bitset>
#i... |
#include <stdio.h>
#include <cmath>
#include <algorithm>
#include <cfloat>
#include <stack>
#include <queue>
#include <vector>
#include <string>
#include <iostream>
#include <set>
#include <map>
#include <time.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define MOD 100000... |
#include <algorithm>
#include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
#define REP(i, a, b) for(int i = (a); i < int(b); ++i)
#define rep(i, n) REP(i, 0, n)
#define ALL(x) begin(x), end(x)
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
constexpr int NUM = 128;
constexpr i... |
#include <iostream>
#include <vector>
#include <string>
#include <map>
#include <algorithm>
using namespace std;
int main() {
while ( true ) {
string t;
string line;
while ( getline( cin, line ) && line.size() ) {
t += line;
}
getline( cin, line );
if ( !line.size() ) break;
string ... |
#include<iostream>
#include<map>
#include<cstring>
using namespace std;
const int MAX = 51;
string text, key;
map<char,int> M;
int numKey[MAX];
typedef long long ll;
bool input(){
text = "";
string s = "";
if(!getline(cin,s)) return false;
if(s == "") return false;
text = s;
while(getline(cin,s)&&s!="... |
#include<cstdio>
#include<string>
#include<iostream>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
int main(){
while(1){
string s,tmp;
while(1){
getline(cin,tmp);
if(tmp=="") break;
s+=tmp;
}
string a; getline(cin,a);
getline(cin,tmp);
if(a=="") break;
int m=a.length();
bool... |
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
string S,K;
const int INF=1<<28;
void solve(){
string ans;
int len=INF, cnt=0;
int left=INF;
int idx[K.length()];
// fill(begin(idx), end(idx), 0);
for(int i=0; i<K.length(); ++i)idx[i]=-1;
for(int p=0; p<S.length(); ++p){
for(in... |
//47
#include<iostream>
#include<sstream>
#include<string>
#include<map>
#include<algorithm>
#include<set>
using namespace std;
int main(){
for(string si;getline(cin,si),si!="";){
string s;
do{
s+=si;
getline(cin,si);
}while(si!="");
string k;
getline(cin,k);
cin.ignore();
ma... |
#include <iostream>
#include <sstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <climits>
#include <cfloat>
using namespace std;
int main()
{... |
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
using namespace std;
int main(){
string str, pat;
vector<char> num;
str.reserve(1000001);
num.reserve(1000001);
pat.reserve(73);
ios::sync_with_stdio(false);
cin.tie(0);
while(true){
str.clear();
pat.clear();
while(true){... |
#include <iostream>
#include <algorithm>
#include <cstring>
#include <string>
using namespace std;
const int INF=1000000000;
char chs[1001];
int main(){
bool fi=false;
string str;
while(getline(cin,str)&&str!=""){
memset(chs,0,sizeof(chs));
string ss;
string tmp;
if(fi)cou... |
#define _USE_MATH_DEFINES
#define INF 0x3f3f3f3f
#include <iostream>
#include <cstdio>
#include <sstream>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <queue>
#include <stack>
#include <limits>
#include <map>
#include <string>
#include <cstring>
#include <set>
#include <deque>
#include <bitset>
#i... |
#include<iostream>
#include<string>
#include<vector>
#include<cstdio>
#include<algorithm>
using namespace std;
bool check(int begin, int end, vector<vector<int> > &ind){
if(begin>end)return false;
for(int i = 0; i < (int)ind.size(); ++i){
if(ind[i].size()==0)return false;
vector<int>::iterator it_b = lowe... |
#include <bits/stdc++.h>
using namespace std;
int main() {
while(1) {
string s="",t,r;
getline(cin,s);
if(s=="") break;
while(1) {
getline(cin,r);
if(r=="") break;
s+=r;
}
getline(cin,t);
getline(cin,r);
map<char,int> m,d;
m.clear();
d.clear();
for(i... |
#include<iostream>
#include<string>
using namespace std;
int main()
{
string text,key,temp;
for(;;)
{
text=key="";
while(getline(cin,text)&&text.empty())
;
if(cin.eof())return 0;
while(getline(cin,temp)&&!temp.empty())
text+=temp;
if(cin.eof())return 0;
while(getline(cin,key)&&key.empty())
;
i... |
/*
000000000011111111112222222222333333333344444444
012345678901234567890123456789012345678901234567
TfefirstemampleistrivivlTfefirstemampleistrifivl
. . .
len = 18 sp = 3
len = 15 sp = 11
len = 12 sp = 22
len = 12 sp = 35
mfv
000000000011111111112222222222
01234567890123456... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(v) begin(v), end(v)
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define reps(i, s, n) for(int i = (int)(s); i < (int)(n); i++)
#define min(...) min({__VA_ARGS__})
#define max(...) max({__VA_ARGS__})
template<class T1, class T2> v... |
#include<iostream>
#include<string>
#include<vector>
using namespace std;
#define rep(i, n) for ( int i = 0; i < (int)n; i++)
bool T[256];
int P[256];
vector<string> compute(string text, string key){
vector<string> ans;
int k = key.size();
rep(i, 256) P[i] = -1;
int l = text.size();
int r = -1;
... |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
int n,m;
cin >> n >> m;
vector<int> after(n+2, 0);
for(int i=0; i<m; i++){
int c,d;
cin >> c >> d;
after[c] = max(after[c], d);
}
int ans = 0;
int farthest = 0;
for(int i=0; i<=n; i++){
farthest = max(farthest, ... |
#include <cstdio>
int N, M;
int imos[1010];
int main() {
scanf("%d%d", &N, &M);
for(int i=0; i<M; i++) {
int l, r; scanf("%d%d", &l, &r);
imos[l]++;
imos[r]--;
}
for(int i=1; i<=N; i++) {
imos[i] += imos[i-1];
}
int prev = -1, ans = N + 1;
for(int i=1; i<=N+... |
#include <iostream>
#include <algorithm>
#include <vector>
#define phb push_back
#define mkp make_pair
#define frs first
#define scn second
#define sz(x) int((x).size())
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef pair< int, int > Pr;
int N, M;
vector< Pr > C;
void read();
void solve();
bool... |
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <functional>
#include <algorithm>
using namespace std;
#define ... |
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <queue>
#include <cstdio>
#include <ctime>
#include <assert.h>
#include <chrono>
#include <random>
#include <numeric>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
using namespace std;
typedef long long int ll;
typed... |
#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 >... |
#include<bits/stdc++.h>
using namespace std;
typedef pair<int,int> pii;
int main(){
int n,m;
cin >> n >> m;
vector<pii> r(m);
for(int i=0;i<m;i++)cin >> r[i].first >> r[i].second;
sort(r.begin(),r.end());
int s=-1,t=-1,sum=0;
for(int i=0;i<m;i++){
if(r[i].first<=t){
t = max(t, r[i].second);
... |
#include<iostream>
#include<string>
#include<vector>
#include<queue>
#include<stack>
#include<map>
#include<set>
#include<algorithm>
#include<functional>
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<cassert>
#include<ctime>
using namespace std;
#define mind(a,b) (a>b?b:a)
#define maxd(a,b) (a>b?a:b)
#de... |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <map>
#include <set>
#include <vector>
#include <stack>
#include <queue>
#include <bitset>
#include <algorithm>
#include <numeric>
#include <functional>
using namespace std;
#define Rep(b, e, i) for(int i = b; i <= e;... |
#include "bits/stdc++.h"
#define REP(i,n) for(ll i=0;i<n;++i)
#define RREP(i,n) for(ll i=n-1;i>=0;--i)
#define FOR(i,m,n) for(ll i=m;i<n;++i)
#define RFOR(i,m,n) for(ll i=n-1;i>=m;--i)
#define ALL(v) (v).begin(),(v).end()
#define PB(a) push_back(a)
#define UNIQUE(v) v.erase(unique(ALL(v)),v.end());
#define DUMP(v) REP... |
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, m;
cin >> N >> m;
vector<bool> b(N);
for (int i = 0; i < m; ++ i) {
int c, d;
cin >> c >> d;
-- c; -- d;
for (int j = c; j < d; ++ j) {
b[j] = true;
}
}
int r = N+1;
for (int i = 0; i < N; ++ i) if (b[i]) r += 2;
cout <<... |
#include <iostream>
using namespace std;
int main() {
int n,d,flg[1002]={};
cin >> n >> d;
for(int i=0;i<d;i++) {
int a,b;
cin >>a>>b;
flg[a] = max(flg[a],b);
}
int sta=0,sum=0,L=0,R=0;
for(int i=0;i<=n;i++) {
if(flg[i] != 0 && sta==1) R=max(R,flg[i]);
else if(flg[i] != 0) L=i,R=flg[... |
#include <cstdio>
#include <cmath>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <queue>
#include <vector>
#include <map>
using namespace std;
typedef long long LL;
int n,m,x,y;
vector<int> v[1005];
int a[1005];
int ans,dq,len,nxt;
int main()
{
scanf("%d%d",&n,&m);
for (int i=... |
#include <iostream>
#include <algorithm>
using namespace std;
struct ioi{
int l,r;
} seg[510];
int n, m;
bool intersect(ioi a,ioi b){
if (a.l>b.l) swap(a,b);
if (b.l<=a.r) return true;
else return false;
}
ioi combine(ioi a,ioi b){
a.l = min(a.l, b.l);
a.r = max(a.r, b.r);
return a;
}
int main(){
cin >> ... |
#define D(x) cout << #x " = " << x << endl
#define DD(x, y) cout << "(" #x ", " #y ") = (" << x << ", " << y << ")" << endl
#define DDD(x, y, z) cout << "(" #x ", " #y ", " #z ") = (" << x << ", " << y << ", " << z << ")" << endl
#define DV(v) for (auto __macro_vi : v){ cout << __macro_vi << " ";} cout << endl;
#define... |
#include <cstdio>
using namespace std;
int s[1010][2],n,m,ans;
int f[1010];
int min(int a,int b){
return a<b?a:b;
}
int main(){
scanf("%d%d",&n,&m);
for(int i=0;i<m;i++){
scanf("%d%d",&s[i][0],&s[i][1]);
//s[i][0]--;]s[i][1]--;
}
for(int i=0;i<m;i++){
for(int j=i+1;j<m;j++){
if(s[j][1]<s[i][1]||(s[j][1]=... |
#include <cstdio>
int main(){
int n,m;
int sum[1010] ={};
scanf("%d%d",&n,&m);
for(int i=0;i<m;i++){
int a,b;
scanf("%d%d",&a,&b);
sum[a-1]++;
sum[b-1]--;
}
int ans=0;
for(int i=0;i<n;i++){
sum[i+1] += sum[i];
ans += !!sum[i] * 2;
}
printf("%d\n",ans+(n+1));
return 0;
} |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
typedef pair<int,int> P;
P t[1002];
int main() {
int n, m;
while (cin >> n >> m) {
for (int i = 0; i < m; i++) {
cin >> t[i].first >> t[i].second;
}
sort(t, t + m);
vector<P> v;
for (int i = 0; i < m; i++... |
#include <bits/stdc++.h>
using namespace std;
typedef vector<int> vec;
int main () {
int N, m; cin >> N >> m;
vec c(m), d(m);
for (int i = 0; i < m; i++) {
cin >> c[i] >> d[i];
}
vec h(N + 1);
for (int i = 0; i < m; i++) {
if (c[i] < d[i]) {
for (int j = c[i] + 1; ... |
#include <bits/stdc++.h>
using namespace std;
int main(void){
int n,m;
cin>>n>>m;
vector<int> s(n+1,0);
for(int i=0;i<m;i++){
int a,b; cin>>a>>b;
s[a]++; s[b]--;
}
partial_sum(s.begin(),s.end(),s.begin());
cout<< n+1+ (n+1-count(s.begin(),s.end(),0))*2 <<endl;
}
|
// Author :
// Date :
// Problem:
// Solution:
// Comment:
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <cmath>
#include <cstring>
#define pp push
#define pb push_back
#define mp make_pair
#define xx first
#define... |
#include <bits/stdc++.h>
using namespace std;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int N,m; cin >> N >> m;
vector<pair<int,int>> pos;
for (int i=0;i<m;++i){
int c,d; cin >> c >> d;
pos.emplace_back(c,d);
}
pos.emplace_back(N+1,N+1);
sort(pos.begin(),pos.e... |
//
// Created by 拓真 on 2018/06/24.
//
#include "bits/stdc++.h"
using namespace std;
int x[11234];
int main(){
int n,m;
cin>>n>>m;
for(int i=0;i<n;i++)x[i]=1;
for(int i=0;i<m;i++){
int c,d;
cin>>c>>d;
for(int j=c;j<d;j++){
x[j]=3;
}
}
int ans=0;
... |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,m;
cin>>n>>m;
vector<int> pos(n+1,1);
for(int i=0;i<m;i++){
int c,d;
cin>>c>>d;
for(int j=c;j<d;j++) pos[j]=3;
}
cout<<accumulate(pos.begin(),pos.end(),0)<<endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
long long int n, m;
cin >> n >> m;
long long int v[1001] = {};
for ( long long int i = 0; i < m; i++ ) {
long long int in_c, in_d;
cin >> in_c >> in_d;
v[ in_c ]++;
v[ in_d ]--;
}
for ( long long int i = 1; i <= n; i++ ) {
v[i... |
#include<bits/stdc++.h>
#define pb emplace_back
#define xx first
#define yy second
using namespace std;
typedef pair<int, int>pi;
vector<pi>vec;
bool vis[1003];
int main()
{
int n, m, x, y;
while(scanf("%d %d", &n, &m)==2)
{
vec.clear();
for(int i=0; i<m; i++)
{
scanf("%d... |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
int n, m, answer = 0;
cin >> n >> m;
bool flag = 0;
int start_point;
vector<int> shop_gap(n + 1, 0);
for (int i = 0; i < m; i++)
{
int c, d;
cin >> c >> d;
for (int j = c; j ... |
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<cctype>
#include<math.h>
#include<string>
#include<string.h>
#include<stack>
#include<queue>
#include<vector>
#include<utility>
#include<set>
#include<map>
#include<stdlib.h>
#include<iomanip>
using namespace std;
#define ll long long
#d... |
#include <algorithm>
#include <bitset>
#include <cstdio>
#include <cassert>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
typedef long long LL;
typedef pair<int, int> P;
typedef pair<L... |
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <set>
#include <map>
#define f first
#define s second
using namespace std;
int n,m;
int main(){
cin >> n >> m;
vector<int> vec(n+2,0);
for(int i = 0;i < m;i++){
int f,t;
cin >> t >> f;
vec[t]++;
vec[f]--;
}
for(int... |
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define rep(i,n) repl(i,0,n)
#define each(itr,v) for(auto itr:v)
#define pb(s) push_back(s)
#define mp(a,b) make_pair(a,b)
#define all(x) (x).begin(),(x).end()
#define dbg(x) cout<<#x... |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<bool> shop(n + 1, false);
for (int i = 0; i < m; i++) {
int c, d;
cin >> c >> d;
for (int j = c; j < d; j++) shop[j] = true;
}
int ans = 0;
for (int i = 0;... |
#include <iostream>
#include <complex>
#include <sstream>
#include <string>
#include <algorithm>
#include <deque>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <vector>
#include <set>
#include <limits>
#include <cstdio>
#include <cctype>
#include <cmath>
#include <cstring>
#include <cstdli... |
//#include<bits/stdc++.h>
#include<iostream>
#include<iomanip>
#include<cmath>
#include<cstdlib>
#include<cstring>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<stack>
#include<map>
#include<numeric>
#include<bitset>
#include<limits>
#include<unordered_map>
#include<functional>
using na... |
#include <iostream>
using namespace std;
int main() {
int n, m, i, f[1002] = {0};
cin >> n >> m;
for (i = 0; i < m; i++) {
int c, d;
cin >> c >> d;
f[c]++;
f[d]--;
}
int ans = n + 1;
for (i = 1; i < n + 2; i++) {
f[i] += f[i - 1];
if (f[i]) ans += 2;
}
cout << ans << endl;
return 0;
} |
#define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
using namespace std;
//#define int int64_t
#define CHOOSE(a) CHOOSE2 a
#define CHOOSE2(a0,a1,a2,a3,x,...) x
#define REP1(i, s, cond, cal) for (signed i = signed(s); i cond; i cal)
#define REP2(i, s, n) REP1(i, s, < signed(n), ++)
#define REP3(i, n) REP2(i, 0, n... |
#define _USE_MATH_DEFINES
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <map>
using namespace std;
typedef pair<long long int, long long int> P;
long long int INF = 1e18;
int DP[2000] = {};
int main(){
... |
#include <bits/stdc++.h>
using namespace std;
int main(){
vector<pair<int, int>> cd;
int N, m, c, d;
cin >> N >> m;
int ans = N + 1;
for(int i = 0; i < m; ++i){
cin >> c >> d;
cd.push_back({c, d});
}
sort(cd.begin(), cd.end());
int start = 0, end = 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> imos(n + 2, 0);
REP(i, m) {
int c, d;
cin >> c >> d;
imos[c]++;
imos[d]--;
}
REP(i, n + 1) imos[i + 1] += imos[i];
int ans = n + 1;
REP(i,... |
#include <cstdio>
#include <cstring>
#include <string>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
#include <set>
#include <map>
#include <bitset>
using namespace std;
#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define rep(i,n) repl(i,0,n)
#... |
#include <stdio.h>
#include <cctype>
#include <limits.h>
#include <math.h>
#include <complex>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <cstring>
#include <string>
#include <sstream>
#include <algorithm>
#include <iomanip>
#include <iostream>
#define V... |
#define __USE_MINGW_ANSI_STDIO 0
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int ll
using VI = vector<int>;
using VVI = vector<VI>;
using PII = pair<int, int>;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#defi... |
#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;
int main()
{
long long int N , M , ans = 0;
cin >> N >> M;
vector<int>data((N + 2)*2);
for(size_t i = 0; i < M; i++)
{
int a , b;
cin >> a >> b;
if(b > a)
{
data[a*2]++;
data[b*2+1]--;
}
}
for(size_t i = 1; i < (N + 2)*2; i++)
{
data[i] += data[i... |
#include <bits/stdc++.h>
using namespace std;
#define for_(i,a,b) for(int i=a;i<b;++i)
#define allof(a) a.begin(),a.end()
typedef pair< int, int > pii;
int N, m;
int main() {
cin >> N >> m;
vector< pii > vp;
for_(i,0,m) {
int c, d; cin >> c >> d;
vp.push_back(pii(c,d));
}
sort(allof(vp));
vector< pi... |
#include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
constexpr int MAX_N = 1000;
int n, m;
cin >> n >> m;
bitset<MAX_N> back;
for(int i = 0; i < m; ++i) {
int c, d;
cin >> c >> d;
if(c > d) continue;
for(int j = c; j < d; ++j) {
back[j] = true... |
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
int main() {
for (int n, m; scanf("%d%d", &n, &m) == 2; ) {
vector<int> a(n + 1, 0);
for (int i = 0; i < m; ++ i) {
int u, v; scanf("%d%d", &u, &v);
a[u] ++; a[v] --;
}
int ret(0);
for (int... |
#include<bits/stdc++.h>
using namespace std;
vector<int> G[1111];
int N,M;
int main(){
cin >> N >> M;
for(int i=0;i<M;i++){
int c,d;
cin >> c >> d;
if( c < d ) G[c].push_back(d);
}
int res = 0;
for(int i=1;i<=N+1;i++){
int rmax = i;
if( G[i].empty() ){
res ++; continue;
}
f... |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> VI;
typedef vector<VI> VVI;
const double PI = 3.14159265358979323846;
const double EPS = 1e-12;
const int INF = numeric_limits<int>::max() / 2;
const int NEG_INF = numeric_limits<int>::min() / 2;
const in... |
#include <iostream>
#include <algorithm>
#include <vector>
#include <utility>
using namespace std;
int main() {
int N, M; cin >> N >> M;
vector<pair<int,int>> V(M);
for(int i = 0; i < M; ++i) {
cin >> V[i].first >> V[i].second;
}
sort(V.begin(), V.end());
int ans = N - 1 + 2;
int index = 0;
while(i... |
#include<iostream>
using namespace std;
int n, q, a, b;
int x[100000], sum;
int main() {
cin >> n >> q;
for (int i = 0; i < q; i++) {
cin >> a >> b;
for (int j = a; j < b; j++) {
x[j] = 1;
}
}
for (int i = 0; i < n; i++) {
sum += 1 + x[i] * 2;
}
cout << sum + 1 << endl;
return 0;
} |
#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdlib>
#include <utility>
#include <cstdio>
#define C first
#define D second
#define MAXN 1100
using namespace std;
typedef pair<int,int> pii;
pii res[MAXN];
int add[MAXN];
bool cmp (const pii &a,const pii &b) { return a.C<b.C; }
... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,x,y) for(int i=(x);i<(y);++i)
#define debug(x) #x << "=" << (x)
#ifdef DEBUG
#define _GLIBCXX_DEBUG
#define print(x) std::cerr << debug(x) << " (L:" << __LINE__ << ")" << std::endl
#else
#define print(x)
#endif
const int inf=1e9;
const int64_t inf64=1e18;
c... |
#include <bits/stdc++.h>
using namespace std;
int n, m;
int a[1000];
int main()
{
scanf("%d %d", &n, &m);
for (int i = 0; i < m; i++){
int c, d;
scanf("%d %d", &c, &d);
--c, --d;
for (int i = c; i < d; i++){
a[i] = 1;
}
}
int res = 0;
for (int i = 0; i < n; i++){
if (a[i]) res += 3;
else res++... |
#include <algorithm>
#include <functional>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <string>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <bitset>
#include <cl... |
#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<algorithm>
using namespace std;
int n,t[1010];
int c[1010],d[1010];
int main()
{
int m;
cin>>n>>m;
for(int i=0;i<m;i++)
{
int l,r;cin>>l>>r;
t[l]++;t[r]--;
}
for(int i=1;i<=n;i++)t[i]+=t[i-1];
int ans=n+1;
for(int i=1;i<=n;i++)ans+=!!t[i]*2;
cout<<ans<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int N, m;
int main() {
cin >> N >> m;
typedef pair< int, int > pii;
set< pii > interval;
for (int i=0; i<m; ++i) {
int c, d;
cin >> c >> d;
// left side
auto it = interval.lower_bound(pii(c, 0));
if (it != interval.begin()) {
--it;
if (c <= (*it... |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <map>
#include <set>
#include <vector>
#include <stack>
#include <queue>
#include <bitset>
#include <algorithm>
#include <numeric>
#include <functional>
using namespace std;
#define Rep(b, e, i) for(int i = b; i <= e;... |
#include <iostream>
#include <vector>
using namespace std;
int main(void){
int n, m;
cin >> n >> m;
vector<int> s(n+2, 0);
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
s[a]++;
s[b]--;
}
for (int i = 0; i < n+2; i++) s[i+1] += s[i];
int l = 0, ... |
#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
typedef pair<int,int> P;
int main() {
int n,m;
cin >> n >> m;
map<int,int> ma;
for(int i=0; i<m; i++) {
int x,y;
cin >> x >> y;
if(ma.count(y)) ma[y]=min(ma[y],x);
else ma[y]=x;
}
ma[0]=0;
vector<P> a;
for(ma... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define mp make_pair
#define pb push_back
#define F first
#define S second
#define endl '\n'
#define ALL(a) (a).begin(),(a).end()
#define SZ(a) (int)((a).size())
typedef long long ll;
typedef pair<int,int> PI;
int main(int argc,... |
#include <algorithm>
#include <cmath>
#include <climits>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <cassert>
#include <func... |
#include<bits/stdc++.h>
#define REP(i,s,n) for(int i=s;i<n;i++)
#define rep(i,n) REP(i,0,n)
using namespace std;
typedef pair<int,int> ii;
int N,m,par[1010];
int find(int x) {
if( x == par[x] ) return x;
return par[x] = find(par[x]);
}
void unit(int x,int y) {
x = find(x), y = find(y);
if( x != y ) par[x... |
#include <iostream>
#include <vector>
#include <cstring>
using namespace std;
void solve()
{
cin.tie(0);
ios::sync_with_stdio(false);
bool needToMoveThreeTimes[1001];
memset(needToMoveThreeTimes, 0, sizeof(needToMoveThreeTimes));
int N, m;
cin >> N >> m;
for (int i = 0; i < m; ++i)
{
int c, d;
cin >> c >... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, m; cin >> N >> m;
vector<int> F(N+1, 1);
for(int i = 0; i < m; ++i) {
int c, d; cin >> c >> d;
for(int j = c; j < d; ++j) F[j] = 3;
}
cout << accumulate(F.begin(), F.end(), 0) << endl;
return 0;
} |
// ACM-ICPCアジア地区予選2014 C. Shopping
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
int N, m;
while(cin >> N >> m){
vector< pair<int,int> > p(m);
for(int i=0;i<m;i++) cin >> p[i].first >> p[i].second;
sort(p.begin(), p.end());
int idx = 0;
int res = N+1;
while... |
#include<bits/stdc++.h>
using namespace std;
int n,m,a,b,ans=1;
int c[1001];
int main(){
scanf("%d %d",&n,&m);
for(int i=0;i<m;i++){
scanf("%d %d",&a,&b);
c[a]++;
c[b]--;
}
for(int i=1;i<=n;i++){
c[i]+=c[i-1];
ans+=(c[i]?3:1);
}
printf("%d\n",ans);
return 0;
} |
#include<iostream>
#include<vector>
#include<algorithm>
#define f first
#define s second
#define inf 1000000001
using namespace std;
int main()
{
int N,m,c,d;
vector<pair<int,int> > V;
cin>>N>>m;
for(int i=0;i<m;i++){
cin>>c>>d;
V.push_back(make_pair(c,d));
}
sort(V.begin(),V.end());
V.push_b... |
#include <algorithm>
#include <iostream>
#include <vector>
#define push push_back
#define sz size()
#define s second
#define f first
using namespace std;
typedef pair<int,int> P;
int main(){
int N,m,c,d,ans=0;
vector<int> v2;
vector<P> v;
cin>>N>>m;
for(int i=0;i<m;i++) cin>>c>>d,v.push(make_pair(c,d));
so... |
// 基本テンプレート
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#in... |
#include<iostream>
#include<vector>
#include<utility>
#include<algorithm>
using namespace std;
int main(int argc, char *argv[])
{
int n, m;
cin >> n >> m;
vector<pair<int,int>> cds;
for(int i = 0; i < m; i++) {
int c, d;
cin >> c >> d;
cds.push_back(make_pair(c,d)); // visits c after d (> c)
}
s... |
#include "bits/stdc++.h"
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, m; cin >> n >> m;
vector<int> imos(n + 10,0);
for (int i = 0; i < m; i++) {
int c, d; cin >> c >> d;
if (c < d) {
imos[c]++;
imos[d]--;
}
}
for (int i = 0; i < n; i++) {
imos[i + 1] += imos... |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N, m;
cin >> N >> m;
vector<int> st(N + 2);
for (int i = 0, c, d; i < m; i++) {
cin >> c >> d;
st[c]++;
st[d]--;
}
int res = N + 1;
for (int i = 1; i <= N; i++) {
st[i] += st[i - 1];
if (st[i]) {
res += 2;
}
}
cout << res << endl;
... |
#include <bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
#define llong long long
using namespace std;
signed main(){
int n,m; cin >> n >> m;
vector<pair<int, int> > b(m);
for(int i = 0; i < m; i++)cin >> b[i].first >> b[i].second;
sort(ALL(b));
vector<int> a(n+1,0);
for(auto e : b){
a[e.first] += 1;
... |
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
using namespace std;
using lint = long long;
using ldouble = long double;
int main() {
int n, m;
cin >> n >> m;
vector<pair<int, int>> ps(m);
for (auto& p : ps) cin >> p.first >> p.second;
ps.emplace_back(n + 1, n + 1);... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(long long i=0; i<(n); i++)
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
in... |
#include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "string"
#include "map"
#include "unordered_map"
#include "unordered_set"
#include "iomanip"
#include "cmath"
#include "random"
#include "bitset"
#include "cstdio"
... |
#define _USE_MATH_DEFINES
#define rep(i, n) for(int i = 0; i < n; i++)
#define repx(i, a, n) for(int i = a; i < n; i++)
#define loop while(1)
#define lli long long int
#include <iostream>
#include <algorithm>
#include <cmath>
#include <numeric>
#include <string>
#include <vector>
#include <stack>
#include <queu... |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<utility>
#include<cmath>
#include<cstring>
#include<queue>
#include<stack>
#include<cstdio>
#include<sstream>
#include<iomanip>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
#define pb... |
#include<iostream>
#include<vector>
using namespace std;
int main(){
int n, m;
std::cin >> n >> m;
vector<bool> visit(n + 1, false);
for (int i = 0; i < m; i++) {
int l, r;
std::cin >> l >> r;
for (int j = l; j < r; j++) {
visit[j] = true;
}
}
int ans = n + 1;
for (int i = 0; i < vi... |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N, m;
scanf("%d %d", &N, &m);
int s[1024] = {0};
for (int i = 0; i < m; i++){
int a, b;
scanf("%d %d", &a, &b);
s[a]++;
s[b]--;
}
int ans = 0;
for (int i = 0; i <= N;){
... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.