text stringlengths 49 983k |
|---|
#include<iostream>
#include<list>
#include<string>
#include<algorithm>
#include <utility>
#include<stdio.h>
#include<climits>
using namespace std;
int main(void){
int n,m;
int c,d;
int f[1000] = {};
cin >> n >> m;
int i,j;
for(i = 0;i < m;i++){
cin >> c >> d;
for(j = c;j < d;j+... |
#include<iostream>
using namespace std;
int main(){
int n,m;
cin >> n >> m;
int p[1050]={};
int i,j,k;
for(i=0;i<m;i++){
cin >> j >> k;
p[j]=max(p[j],k);
}
int inf = 1<<15;
int dp[1050][1050];
fill(dp[0],dp[1049],inf);
dp[0][0]=0;
i=0;
for(j=max(i+1,p[i+1]);j<=n+1;j++){
dp[j][i+1]=mi... |
#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"bits/stdc++.h"
using namespace std;
using ll = int64_t;
int main() {
ll N, m;
cin >> N >> m;
vector<ll> restricts(N, -1);
for (int i = 0; i < m; i++) {
ll c, d;
cin >> c >> d;
c--; d--;
restricts[c] = max(restricts[c], d);
}
ll ans = 0;
ll left = IN... |
#include<bits/stdc++.h>
using namespace std;
int n,m;
bool b[3000]={};
int main(){
cin>>n>>m;
while(m--){
int l,r;
cin>>l>>r;
for(int i=l;i<r;i++){
b[i]=true;
}
}
int ans=0;
for(int i=0;i<n+1;i++){
if(b[i]) ans+=3;
else ans++;
}
cout<<ans<<endl;
}
|
#include "bits/stdc++.h"
#include<unordered_map>
#include<unordered_set>
#pragma warning(disable:4996)
using namespace std;
using ld = long double;
template<class T>
using Table = vector<vector<T>>;
int main() {
int N,m; cin >> N >> m;
vector<int>backs(N, false);
for (int i = 0; i < m; ++i) {
int t, f; cin >> t ... |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,M;
cin >> N >> M;
vector< pair<int,int> > e;
int ans = N + 1 ;
for(int i = 0 ; i < M ; i++){
int a,b;
cin >> a >> b;
e.push_back(make_pair(a,b));
}
if( M == 0 ){
cout << ans << endl;
return 0;
}
sort(e.begin(),e.end());
int le = e[0].... |
#include <bits/stdc++.h>
using namespace std;
#define int long long // <-----!!!!!!!!!!!!!!!!!!!
#define rep(i,n) for (int i=0;i<(n);i++)
#define rep2(i,a,b) for (int i=(a);i<(b);i++)
#define rrep(i,n) for (int i=(n)-1;i>=0;i--)
#define rrep2(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define all(a) (a).begin(),(a).end()
... |
#include <bits/stdc++.h>
#define For(i, a, b) for(int (i)=(int)(a); (i)<(int)(b); ++(i))
#define rFor(i, a, b) for(int (i)=(int)(a)-1; (i)>=(int)(b); --(i))
#define rep(i, n) For((i), 0, (n))
#define rrep(i, n) rFor((i), (n), 0)
#define fi first
#define se second
using namespace std;
typedef long long lint;
typedef uns... |
#include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <algorithm>
#include <sstream>
#include <map>
#include <set>
#define REP(i,k,n) for(int i=k;i<n;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define INF 1<<30
#define pb push_back
#define mp make_pair
using namespace std;
typedef long l... |
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
#define MAX 600
struct rest{
int start, end;
inline void set(int a, int b){ start = a; end = b; }
bool operator < (const rest &a) const { return end < a.end; }
} rests[MAX];
int n, m, restlen;
bool exist[MAX];
int main(){
int a, b... |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define MOD ((int)1e9+7)
#define MAX 2000
int N, m, ans;
int c[MAX], d[MAX];
int temp[MAX];
signed main(){
cin>>N>>m;
for(int i = 0; i < m; i++){
cin>>c[i]>>d[i];
temp[c[i]]++;
temp[d[i]]--;
}
for(int i = 0; i <= N; i++){
... |
#include <cstdio>
int n,m;
int c[501],d[501];
int cnt[1001];
int main(void){
scanf("%d %d",&n,&m);
for(int i=0;i<m;i++){
scanf("%d %d",&c[i],&d[i]);
for(int j=c[i];j<d[i];j++){
cnt[j]=1;
}
}
int res=n+1;
for(int i=0;i<=n;i++){
res+=cnt[i]*2;
}
printf("%d\n",res);
return 0;
} |
/*
* c.cc:
*/
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functi... |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<utility>
#include<cmath>
#include<cstring>
#include<queue>
#include<cstdio>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
#define pb push_back
#define mp make_pair
#define all(in) in.be... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
long long int ans = LLONG_MIN / 6;
long long int now;
cin >> ans;
now = ans;
ans--;
for( size_t i = 1; i < M; i++ ) {
long long int a;
cin >> a;
ans = max( (a - now) / 2, ans );
now = a;
}
ans = max( N - now, ans );
... |
#include<bits/stdc++.h>
using namespace std;
const int INF = 1 << 28;
int N, M, B[100000];
int dp[100000][4];
int rec(int idx, int dir)
{
if(idx < 0 || idx >= N) return(INF);
if(~dp[idx][dir + 1]) return(dp[idx][dir + 1]);
if(B[idx]) return(0);
return(dp[idx][dir + 1] = rec(idx + dir, dir) + 1);
}
int main... |
#include <bits/stdc++.h>
using namespace std;
#define _MACRO(_1, _2, _3, NAME, ...) NAME
#define _repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define _rep(i,n) _repl(i,0,n)
#define rep(...) _MACRO(__VA_ARGS__, _repl, _rep)(__VA_ARGS__)
#define mp make_pair
#define pb push_back
#define all(x) begin(x),end(x)
#define ... |
#include <iostream>
using namespace std;
int main()
{
int n, m;
int a, last_a;
int max_diff = 0;
int diff;
cin >> n >> m;
cin >> a;
last_a = a;
max_diff = a -1;
for (int i = 1; i < m; i++) {
cin >> a;
diff = a - last_a - 1;
!(diff % 2) ? diff /= 2 : diff = diff / 2 + 1;
if (diff >... |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define all(c) (c).begin(),(c).end()
#define mp make_pair
#define pb push_back
#define each(i,c) for(__typeof((c).begin()) i=(c).begin();i!=(c).end();i++)
#define dbg(x) cerr<<__LINE__<<": "<<#x<<" = "<<(x)<<endl
using namespace std;
typedef long lon... |
#include <iostream>
#include <vector>
using namespace std;
int main(){
int n,m;
cin >> n >> m;
if(m == 1){
int a;
cin >> a;
cout << max(a-1,n-a) << endl;
return 0;
}
vector<int> a(m);
for(int i = 0; i < m; i++){
cin >> a[i];
}
int ans = 0;
for... |
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
int n, m, a[100000], ans=0;
cin>>n>>m;
for(int i=0;i<m;i++) cin>>a[i];
for(int i=1;i<m;i++) ans=max(ans, (a[i]-a[i-1])/2);
ans=max(ans, a[0]-1);
ans=max(ans, n-a[m-1]);
cout<<ans<<endl;
return 0;
} |
#define _USE_MATH_DEFINES
#include <iostream>
#include <fstream>
#include<vector>
#include<algorithm>
using namespace std;
struct init{
init(){
cin.tie(0); ios::sync_with_stdio(false);
}
}________init;
int main() {
#ifdef INPUT_FROM_FILE
ifstream cin("sample.in");
ofstream cout("sample.out");
#endif
int n, m;
... |
#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>
... |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
int n,m;
cin >> n >> m;
vector<int> a(m);
cin >> a[0];
int ma=0;
for(int i=1;i<m;i++){
cin >> a[i];
int tmp = (a[i]-a[i-1])/2;
ma = max(ma,tmp);
}
//cout << ma << endl;
... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n,m;
cin >> n >> m;
int d[n],d2[n],ans=0;
fill(d,d+n,1<<29);
fill(d2,d2+n,1<<29);
for(int i=0,x; i<m; i++) {
cin >> x;
d[x-1]=d2[x-1]=0;
}
for(int i=1; i<n; i++) d[i]=min(d[i],d[i-1]+1);
for(int i=n-2; i>=0; i--) d2[i]=min(d2[i],d... |
/*
* a.cc:
*/
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functi... |
#include <bits/stdc++.h>
using namespace std;
int t[100000];
int main(){
int n,m; cin>>n>>m;
vector<int> a(m);
for(int i=0;i<n;i++) t[i]=1e9;
queue<int> q;
for(int i=0;i<m;i++){
cin>>a[i]; a[i]--;
t[a[i]]=0;
q.push(a[i]);
}
while(!q.empty()){
int cur=q.front(); q.pop();
if(cur+1<n){
if(t[cur+1]>t[cu... |
#include <iostream>
#include <vector>
#include <string>
#include <sstream>
#include <algorithm>
#include <map>
#include <set>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <stack>
#include <queue>
#include <utility>
#define rep(i,l,n) for(lint i=l;i<n;i++)
#define rer(i,l,n) for(lint i=l;i<=n;i++)
#def... |
#define _USE_MATH_DEFINES
#include<stdio.h>
#include<stdlib.h>
#include<algorithm>
#include<vector>
#include<string>
#include<queue>
#include<iostream>
#include<fstream>
#include<iomanip>
using namespace std;
int n, m;
int data[100000];
int main(){
scanf("%d%d", &n, &m);
for (int i = 0; i < m; ++i){
scanf("%d",... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define mp make_pair
#define fr first
#define sc second
#define Rep(i, n) for( int i = 0; i < (n); i++ )
#define Rrep(i, a, n) for( int i = (a); i < (n); i++ )
#define All(v) v.begin(), v.end()
typedef pair<int, int> Pii;
typedef... |
#include <iostream>
#include <queue>
#define REP(i,a,b) for(int i=a;i<(int)b;i++)
#define rep(i,n) REP(i,0,n)
using namespace std;
int main() {
int n; cin >> n;
int m; cin >> m;
vector<int> a;
rep(i, m) {
int x; cin >> x; x--;
a.push_back(x);
}
int ans = 0;
REP(i, 0, (int)a.size()-1) {
... |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;++i)
#define FOR(i,a,b) for(int i=a;i<=b;++i)
#define LL long long
#define Fi first
#define Se second
using namespace std;
static const LL INF = 1LL<<61LL;
typedef pair<int,int> PII;
int N,M;
int A[100010];
int temp=1;
int ans;
int main(){
cin>>N>>M;
re... |
#include <iostream>
using namespace std;
int main(){
int n,m,a[100000],r=0;;
cin>>n>>m;
for(int i=0;i<m;i++) cin>>a[i];
r=max(a[0]-1,n-a[m-1]);
for(int i=1;i<m;i++) r=max(r,(a[i]-a[i-1])/2);
cout<<r<<endl;
return 0;
} |
#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>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef complex<double> P;
typedef pair<int,int> pii;
#define REP(i,n) for(ll i=0;i<n;++i)
#define REPR(i,n) for(ll i=1;i<n;++i)
#define FOR(i,a,b) for(ll i=a;i<b;++i)
#define DEBUG(x) cout<<#x<<": "<<x... |
#include <iostream>
#include <algorithm>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
int n,m;
int a[200005];
int b[200005];
int main() {
cin>>n>>m;
rep(i,m) cin>>a[i];
rep(i,m) a[i]--;
rep(i,200005) b[i]=1e8;
rep(i,m) b[a[i]]=0;
rep(i,n) if(i) {
b[i]=min(b[i],b[i-1]+1)... |
#include<iostream>
#include<vector>
#include<cassert>
#include<string>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<stack>
#include<queue>
#include<set>
#include<map>
#include<tuple>
#include<numeric>
using namespace std;
typedef pair<int,int> pii;
typedef long long ll;
typedef ll in... |
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#define pb push_back
#define rep(i,n) for (int i = 0; i < n; ++i)
#define rrep(i,n) for (int i = 1; i <= n; ++i)
#define drep(i,n) for (int i = (n)-1; i >= 0; --i)
#define mins(x,y) x = min(x,y)
#define maxs(x,y) x = max(x,y)... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n,m;cin>>n>>m;
int ans=0;
int b;
for(int i=0;i<m;i++){
int a;cin>>a;
if(i==0)ans=max(ans,a-1);
else ans=max(ans,(a-b)/2);
b=a;
}
ans=max(ans,n-b);
cout<<ans<<endl;
return 0;
}
|
#include <iostream>
#include <algorithm>
#define rep(i, n) for(int i = 0; i < (n); ++i)
using namespace std;
int n, m;
int a[100000];
int main(){
cin >> n >> m;
rep(i, m){
cin >> a[i];
}
int ans = max(a[0] - 1, n - a[m - 1]);
rep(i, m - 1){
ans = max((a[i + 1] - a[i]) / 2, ans);
}
cout << ans ... |
#include <cstdio>
#include <algorithm>
using namespace std;
int main() {
int n, m, t, prev = 1, curr, ans = 0;
scanf("%d %d", &n, &m);
scanf("%d", &curr);
if (curr > 1) {
ans = curr - 1;
prev = curr;
}
for (int i = 1; i < m; i++) {
scanf("%d", &curr);
t = (curr... |
/* _/ _/ _/_/_/ _/
_/_/_/_/ _/_/ _/_/_/_/ _/_/ _/ _/_/
_/ _/ _/ _/ _/ _/ _/_/_/ _/
_/ _/ _/ _/ _/ _/ _/ _/ _/
_/_/ _/_/ _/_/ _/_/ _/_/ _/ */
#include<iostream>
#include<algorithm>
#include<cmath>
#i... |
#include <iostream>
using namespace std;
int N,M;
const int MAX_N = 100010;
const int INF = 1 << 20;
int A[MAX_N];
int Left[MAX_N];
int Right[MAX_N];
int main(){
cin >> N >> M;
int result = 0;
for (int i = 0; i < M; i++){
int x;
cin >> x;
x--;
A[x]++;
}
int tmp = INF;
for (int i = 0; i < ... |
#include<iostream>
#include<algorithm>
using namespace std;
int main() {
int n, m, i, in, def = 0, ans = 0, before = 0;
cin >> n >> m;
for(i = 0; i < m; i++) {
cin >> in;
if(i == 0 && in != 1) {
def = in - 1;
}
else def = (in-before)/2 +0.5;
ans = max(ans, def);
before... |
#include<iostream>
using namespace std;
int main()
{
int n, m, d;
cin >> n >> m;
bool a[n+2];
for( int i = 0; i < n + 2; i++ )
a[i] = 0;
a[0] = a[n+1] = 1;
int ma = 0;
for( int i = 0; i < m; i++ )
{
cin >> d;
if( i == 0 )
ma = d - 1;
if( i ... |
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <set>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <cstdio>
#include <cstring>
#include <iterator>
#include <b... |
#include "bits/stdc++.h"
using namespace std;
int main() {
int N, M; cin >> N >> M;
vector<int>v;
for (int i = 0; i < M; ++i) {
int a; cin >> a;
v.emplace_back(a);
}
int ans = 0;
ans = max(ans, v[0] - 1);
ans = max(ans, N - v.back());
for (int i = 0; i < M-1; ++i) {
ans = max(ans, (v[i + 1] - v[i]) / 2);... |
#include <fstream>
#include <iostream>
#include <vector>
#include <iomanip>
#include <algorithm>
using namespace std;
#define ALL(c) (c).begin(), (c).end()
#define REP(i,n) for(ll i=0; i < (n); ++i)
using ll = long long;
using vl = vector<ll>;
int main(){
#ifdef _WIN32
ifstream cin("sample.in");
ofstream cout("sampl... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int n,m;
int a[100001];
int main(void){
scanf("%d%d",&n,&m);
for(int i=0;i<m;i++){
scanf("%d",&a[i]);
}
int ans=max(a[0]-1,n-a[m-1]);
for(int i=0;i<m-1;i++){
ans=max(ans,(a[i+1]-a[i])/2);
}
printf("%d\n",ans);
ret... |
#include <stdio.h>
int main(void) {
int m, n, i, j, be = 1, ans = 0, t;
scanf("%d%d", &n, &m);
for(i = 0; i < m; ++i) {
scanf("%d", &t);
if(!i) ans = t - 1;
else if((t - be) / 2 > ans) ans = (t - be) / 2;
be = t;
}
if(n - be > ans) ans = n - be;
printf("%d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define fi first
#define se second
#define dbg(x) cout<<#x" = "<<((x))<<endl
template<class T,class U> ostream& operator<<(ostream& o, const pa... |
#include<iostream>
using namespace std;
int main(){
int sum;
while(cin >> sum){
int number, info[100005], ans;
cin >> number;
for(int i = 0; i < number; i++){
cin >> info[i];
}
for(int i = 0; i < number + 1; i++){
if(!i){
ans = info[i] - 1;
}else if(i == number){
ans = max(ans, sum ... |
/*
_ooOoo_
o8888888o
88" . "88
(| -_- |)
O\ = /O
____/`---'\____
.' \\| |// `.
/ \\||| : |||// \
/ _||||| -:- |||||- \
| | \\\ - /// | |
... |
#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 <iostream>
#include <vector>
int main()
{
int n, m;
std::cin >> n >> m;
std::vector<int> min_t(n, (1 << 29));
for (int i = 0; i < m; i++) {
int a;
std::cin >> a;
min_t[a - 1] = 0;
}
for (int i = 1; i < n; i++) {
min_t[i] = std::min(min_t[i], min_t[... |
#include <iostream>
#include <algorithm>
#include <string>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <cstdio>
#include <cmath>
#define rep(i,a,b) for(int (i)=(a);i<(b);i++)
#define INF 100000000
#define MAX_N 1000000
using namespace std;
int main(){
int n,m,a=0,b=0;
cin>>n>>m;
... |
#include <stdio.h>
#include <cmath>
#include <algorithm>
#include <cfloat>
#include <stack>
#include <queue>
#include <vector>
#include <string>
#include <iostream>
#include <set>
#include <map>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define MOD 1000000007
#define EPS 0... |
#include<bits/stdc++.h>
using namespace std;
#define int long long
typedef long long ll;
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... |
#include<iostream>
#include<iomanip>
#include<string>
#include<cstdlib>
#include<cmath>
#include<algorithm>
#include<vector>
#include<iomanip>
using namespace std;
int main() {
int n,m;
cin >> n >> m;
int count = 0;
int input;
int ex;
for(int i=0; i<m; i++) {
cin >> input;
if(i == 0 && input-1 > count) c... |
#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
int n ;
int m;
int a[100000];
int b;
int ans = 0;
cin >> n >> m;
for (int i = 0; i < m; i++){
cin >> a[i];
}
for (int i = 0; i < m + 1; i++){
if (i == 0){
b = a[i] - 1;
} else if (i == m){
b = n - a[i - 1];
}
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;
vector<int> se;
se.resize(m);
REP(i,m) cin >> se[i];
int answer=0;
answer=max(... |
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <queue>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstring>
#include <cctype>
#include <cassert>
#include <limits>
#include <functional>
#define re... |
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <iostream>
#include <vector>
#include <string>
#include <sstream>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <functional>
using nam... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
set<int> ok;
for(int i = 0; i < m; ++i) {
int a;
cin >> a;
ok.emplace(a);
}
int ans = 0;
for(int i = 1; i <= n; ++i) {
auto it = ok.lower_bound(i);
int mn = INT_MAX;
if(it != ok.end()) {
mn = min(mn, *it - i);
... |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n, m;
cin >> n >> m;
vector<int> A;
A.push_back(1);
int a;
for(int i = 1; i <= m; i++)
{
cin >> a;
A.push_back(a);
}
A.push_back(n);
int ans = 0;
for(int i = 1; i < A.size(); i++)
{
int tmp;
if(i == 1 || i == A.size() - 1)
tmp = A[i] ... |
#include <stdio.h>
#include <math.h>
#include <iostream>
#include <complex>
#include <vector>
#include <utility>
#include <algorithm>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define mp make_pair
const double EPS = 1e-12;
const double pi = atan2(0.0, -1.0);
typedef complex<double> P;
d... |
#include <iostream>
#include <iomanip>
#include <complex>
#include <vector>
#include <algorithm>
#include <cmath>
#include <array>
using namespace std;
const double EPS = 1e-8;
const double INF = 1e12;
const double PI = acos(-1);
#define EQ(n,m) (abs((n)-(m)) < EPS)
#define X real()
#define Y imag()
typedef complex<do... |
#include<iostream>
#include<string>
#include<queue>
#include<algorithm>
#include<set>
using namespace std;
#define rep(i,n) for ( int i = 0; i < n; i++)
static const int MAX = 50;
static const int PMAX = 11;
static const string DT = "URDL";
static const int di[4] = {-1, 0, 1, 0};
static const int dj[4] = {0, 1, 0, -1};... |
#include <bits/stdc++.h>
template<class Converter, class SuffixInfo, int NODE_NUM = 1000000>
class AhoCorasick {
public:
using value_structure = typename Converter::value_structure;
using size_type = std::uint64_t;
static constexpr size_type num_of_kinds = Converter::num_of_kinds;
using value_type = typename ... |
#include <bits/stdc++.h>
using namespace std;
const int INF = 1e8;
const int dx[] = { 1, 0, -1, 0 };
const int dy[] = { 0, 1, 0, -1 };
string D = "DRUL";
const int var = 4;
int trans(char c) {
switch (c)
{
case 'R': return 0;
case 'D': return 1;
case 'L': return 2;
case 'U': return 3;
default: assert(false)... |
/*
* AOJ 2212: Stolen Jewel
* ?¢?????????°?????????????????°??°???????????¨?????¨???????????????????????¨???????????¶?????????????????¢?????????????????¨???????????????????????¢????¬????????????¶????±???°????????????????°???\??°???
* ?±???????DP+?????????
* ??????????????¢?§???????????????????????????¶???????¢?????... |
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#include <cstdio>
#include <cstring>
using namespace std;
#define REP(i,a,n) for(int i=(a); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define DEB 0
#define all(x) x.begin(), x.end()
#define mp make_pair
#define pb push_back
... |
#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <iostream>
#include <math.h>
#include <assert.h>
#include <vector>
#include <set>
#include <string>
#include <queue>
using namespace std;
typedef long long ll;
static const double EPS = 1e-9;
static const double PI = acos(-1.0);
#define REP(i, n) fo... |
#include<bits/stdc++.h>
using namespace std;
int to[256];
struct TrieNode
{
int nxt[5];
int exist; // ???????????\???????????¨????????????????????°???????¨?
vector< int > accept; // ???????????????id
TrieNode() : exist(0)
{
memset(nxt, -1, sizeof(nxt));
}
};
struct Trie
{
vector< TrieNode > node... |
#include <bits/stdc++.h>
using namespace std;
const int INF = 1e8;
const int dx[] = { 1, 0, -1, 0 };
const int dy[] = { 0, 1, 0, -1 };
string D = "DRUL";
const int var = 4;
int trans(char c) {
switch (c)
{
case 'R': return 0;
case 'D': return 1;
case 'L': return 2;
case 'U': return 3;
default: break;
}
ex... |
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <set>
#include <queue>
#include <map>
#include <fstream>
#include <cstring>
#include <sstream>
using namespace std;
typedef long long ll;
class Sit{
public:
int x,y;
int cur;
};
class AhoCorasick{
private:
/... |
#include<iostream>
#include<vector>
#include<tuple>
#include<queue>
#include<set>
using namespace std;
struct S{
int y,x,t;
vector<int> v;
};
int main(){
for(int N,M;cin>>N>>M,N;){
char g[50][51];
int y,x;
for(int i=0;i<N;i++){
cin>>g[i];
for(int j=0;j<M;j++){
if(g[i][j]=='S'){
y=i;... |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <queue>
#include <utility>
#include <tuple>
#define maxn 55
#define maxV 105
#define mt make_tuple
using namespace std;
typedef long long ll;
typedef tuple<int, int, int> T;
struct node{
int chi[4], fail;
bool f... |
#include <iostream>
#include <cstdlib>
#include <map>
#include <vector>
#include <queue>
#include <algorithm>
#define rep(i,n) for(int i = 0 ; i < n ; i++)
using namespace std;
struct NODE{
int x,y,a,b,cost;
NODE(int A,int B,int C,int D,int E){
x = A ,
y = B ,
a = C ,
b = D ,
cost = E ;
}
};
int dx[]... |
/*
* AOJ 2212: Stolen Jewel
* ???????????°?????????????????°??°???????????¨?????¨???????????????????????¨???????????¶?????????????????¢?????????????????¨???????????????????????¢????¬????????????¶????±???°????????????????°???\??°???
* ?±???????DP+?????????
* ??????????????¢?§???????????????????????????¶???????¢?????... |
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <cfloat>
#include <ctime>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include... |
#include <cstdio>
#include <cstring>
#include <vector>
#include <algorithm>
#include <queue>
using namespace std;
struct node{
int proh;
int to[4];
int fail;
node(){
proh = 0;
memset(to, -1, sizeof to);
fail = 0;
}
};
int w, h;
char field[52][52];
vector<node> ac;
int dx[] = {-1, 0, 1, 0};
int dy[] = {0, ... |
#include <bits/stdc++.h>
using namespace std;
struct Ahocora{
int idx;
struct PMA {
int state;
PMA* next[256];
vector<int> matched;
PMA(int idx) { memset(next, 0, sizeof(next)); state = idx ; }
~PMA() { for(int i = 0; i < 256; i++) if(next[i]) delete next[i]; }
};
vector<int> se... |
class _in{struct my_iterator{int it;const bool rev;explicit constexpr my_iterator(int it_, bool rev=false):it(it_),rev(rev){}constexpr int operator*(){return it;}constexpr bool operator!=(my_iterator& r){return it!=r.it;}void operator++(){rev?--it:++it;}};const my_iterator i,n;public:explicit constexpr _in(int n):i(0),... |
#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 <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 <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;... |
#include <bits/stdc++.h>
using namespace std;
const int INF = 1e8;
const int dx[] = { 1, 0, -1, 0 };
const int dy[] = { 0, 1, 0, -1 };
string D = "DRUL";
const int var = 4;
int trans(char c) {
switch (c)
{
case 'R': return 0;
case 'D': return 1;
case 'L': return 2;
case 'U': return 3;
default: break;
}
ex... |
#include<iostream>
#include<map>
#include<cassert>
#include<cstdlib>
#include<algorithm>
#include<numeric>
#include<vector>
#include<queue>
using namespace std;
#define REP(i,b,n) for(int i=b;i<n;i++)
#define rep(i,n) REP(i,0,n)
const int N = 5;
const int NODE=120;
struct PMA{
PMA *next[N];
int ac;
PMA(){fill... |
#include <cstdio>
#include <vector>
#include <stack>
#include <iostream>
#include <string>
#include <tuple>
#include <random>
#include <map>
#include <queue>
#include <set>
#include <complex>
#include <algorithm>
#include <cassert>
#include <iterator>
#include <numeric>
using namespace std;
typedef long double ld;
ty... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int ll
using PII = pair<int, int>;
template <typename T> using V = vector<T>;
template <typename T> using VV = vector<V<T>>;
template <typename T> using VVV = vector<VV<T>>;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(... |
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <set>
#include <queue>
#include <map>
#include <fstream>
using namespace std;
class Sit{
public:
int x,y;
string cur;
};
class AhoCorasick{
private:
static const int MAX_V=1000001;
private:
map<string,int> _dict;
int _vertex;
... |
//Name: Stolen Jewel
//Level: 3
//Category: グラフ,Graph,Aho-Corasick
//Note:
/**
* Aho-Corasick法のオートマトンを作成し、(現在位置,Aho-Corasickのノード位置)で幅優先探索すればよい。
*
* オーダーはO(NMP|S|)。
*/
#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <array>
#include <tuple>
using namespace std;
template <typenam... |
#include<bits/stdc++.h>
using namespace std;
struct TrieNode
{
int nxt[27];
int exist; // ???????????\???????????¨????????????????????°???????¨?
vector< int > accept; // ???????????????id
TrieNode() : exist(0)
{
memset(nxt, -1, sizeof(nxt));
}
};
struct Trie
{
vector< TrieNode > nodes;
int root... |
#include <bits/stdc++.h>
using namespace std;
const int var = 4;
const int pmax = 1e4;
int trans(char c) {
switch (c)
{
case 'R': return 0;
case 'D': return 1;
case 'L': return 2;
case 'U': return 3;
default: assert(false);
}
}
struct ac_node {
ac_node *fail;
ac_node *next[var];
vector<int> ok;
ac_node()... |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
#include<vector>
#include<string>
#include<queue>
namespace ProconLib{
template<class Language>
class AhoCorasick{
public:
using char_t=typename Language::char_t;
using string_t=typename Language::string_t;
... |
#include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <queue>
#include <algorithm>
using namespace std;
int Psz;
struct PMA{
int n;
PMA *next[0x200];
vector<int> accept;
PMA() { fill(next, next+0x200, (PMA*)0); }
PMA(int a)
{
n=a;
fill(next, next+0x200, (PMA*)0);
}
};
PMA *bui... |
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <cfloat>
#include <ctime>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define each(i,a) for (auto&& i : a)
#define FOR(i,a,b) for (ll i=(a),__last_##i=(b);i<__last_##i;i++)
#define RFOR(i,a,b) for (ll i=(b)-1,__last_##i=(a);i>=__last_##i;i--)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) RFOR(i... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.