text stringlengths 49 983k |
|---|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
int n,m;
long long total=0;
int main(){
std::ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin>>n>>m;
vector<vector<int>> a(n,vector<int>(n,0));
for(int i=0;i<m;i++){
int x,y,z;
cin>>x>>y>>z;
--x,--y;
a[x][y]=a[y][x]=z;
total+=z;
}
const int inf=(int)1e9;
vector<int> inside(1<<n);
for(int t=0;t<(1<<n);t++){
for(int i=0;i<n;i++){
if(t&(1<<i)){
for(int j=i+1;j<n;j++){
if(t&(1<<j)){
inside[t]+=a[i][j];
}
}
}
}
}
vector<vector<int> > dp(1<<n,vector<int>(n,-1));
for(int t=0;t<(1<<n);t++) if(t&1) dp[t][0]=inside[t];
for(int t=0;t<(1<<n);t++) {
for(int ii=0;ii<n;ii++) {
if(dp[t][ii]==-1) continue;
int u=(1<<n)-1-t;
while(u>0) {
for(int j=0;j<n;j++) {
if(u&(1<<j)) {
if(a[ii][j]>0) {
dp[t|u][j]=max(dp[t|u][j],dp[t][ii]+inside[u]+a[ii][j]);
}
}
}
u=(u-1)&((1<<n)-1-t);
}
}
}
cout<<total-dp[(1<<n)-1][n-1]<<'\n';
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
#define MAXN (1<<15)+3
int n,m,a,b,c,sum[MAXN],f[MAXN][21],p[21][21],res,ans;
int main(){
scanf("%d%d",&n,&m);
int maxs=(1<<n)-1;
for(int i=1;i<=m;i++){
scanf("%d%d%d",&a,&b,&c);
p[a][b]=p[b][a]=c;
res+=c;
}
for(int s=0;s<=maxs;s++){
for(int i=1;i<=n;i++)
if(s&(1<<(i-1))){
for(int j=1;j<=n;j++)
if(s&(1<<(j-1))){
sum[s]+=p[i][j];
}
}
sum[s]>>=1;
}
memset(f,-1,sizeof(f));
f[1][1]=0;
for(int s=0;s<=maxs;s++){
for(int i=1;i<=n;i++){
if(f[s][i]==-1) continue;
for(int j=1;j<=n;j++){
if(s&(1<<(j-1))) continue;
if(!p[i][j]) continue;
f[s|(1<<(j-1))][j]=max(f[s|(1<<(j-1))][j],f[s][i]+p[i][j]);
}
int rest=(maxs^s)|(1<<(i-1));
for(int ss=rest;ss;ss=rest&(ss-1)){
f[s|ss][i]=max(f[s|ss][i],f[s][i]+sum[ss]);
}
}
}
int ans=0;
for(int i=0;i<=maxs;i++)
ans=max(ans,f[i][n]);
printf("%d\n",res-ans);
} |
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int n,m;
int H[20][20];
int F[1<<15|1][17],Cost[1<<15|1][17];
int Cost2[1<<15|1],B[1<<15|1];
const int INF=0x7f7f7f7f;
void Init(){
for(int s=0;s<(1<<n);++s)
for(int i=0;i<n;++i)
if(s>>i&1) for(int j=0;j<n;++j)
if(!(s>>j&1)) Cost[s][j]+=H[i][j];
}
int main(){
scanf("%d%d",&n,&m);
int a,b,c;
for(int i=1;i<=m;++i){
scanf("%d%d%d",&a,&b,&c);
--a; --b;
H[a][b]=H[b][a]=c;
}
Init();
int N=(1<<(n-1)),M;
memset(F,0x7f,sizeof(F));
F[1][0]=0;
for(int s=0,t,i,x,j,s2;s<N;++s){
t=(s<<1|1);
for(i=0;i<n;++i){
if(F[t][i]==INF) continue;
if(!(t>>i&1)) continue;
x=F[t][i];
for(j=0;j<n;++j){
if(!(t>>j&1)&&H[i][j]){
F[t|(1<<j)][j]=min(F[t|(1<<j)][j],x+Cost[t^(1<<i)][j]);
}
}
M=((1<<n)-1-t);
for(j=0;j<n;++j)
if(M>>j&1) Cost2[1<<j]=Cost[t^(1<<i)][j];
for(s2=M,j=0;s2;s2=(s2-1)&M) B[j++]=s2;
for(;~j;--j) if(B[j]&(B[j]-1)) Cost2[B[j]]=Cost2[B[j]&(B[j]-1)]+Cost2[B[j]&(-B[j])];
for(s2=M;s2;s2=(s2-1)&M){
F[t|s2][i]=min(F[t|s2][i],x+Cost2[s2]);
}
}
}
printf("%d\n",F[(1<<n)-1][n-1]);
getchar(); getchar();
return 0;
}
|
#include<cstdio>
#include<algorithm>
using namespace std;
const int MAXN = 15 + 5;
const int ALL = (1<<15) + 5;
const int inf = 0x3f3f3f3f;
inline void chk_max(int &a,int b){ if(a<b) a=b;}
int lb[ALL];
#define bit(x,i) (((x)>>(i))&1)
#define lowbit(x) ((x)&-(x))
int g[MAXN][MAXN];
int cost[ALL],f[ALL][MAXN];
int main(void)
{
int n,m;
scanf("%d%d",&n,&m);
for(int i=1; i<=m; ++i)
{
int u,v,w;
scanf("%d%d%d",&u,&v,&w);
g[u][v]=g[v][u]=w;
}
int all = (1<<n)-1;
for(int mask=0; mask<=all; ++mask)
{
for(int i=1; i<=n; ++i) if(bit(mask,i-1))
for(int j=1; j<i; ++j) if(bit(mask,j-1))
cost[mask]+=g[i][j];
}
for(int mask=0; mask<=all; ++mask)
{
for(int i=1; i<=n; ++i) f[mask][i]=-inf;
if(mask&1) f[mask][1]=cost[mask];
}
int ans=0;
for(int mask=1; mask<=all; mask+=2)
{
if(bit(mask,n-1))
{
chk_max(ans,f[mask][n]);
continue;
}
for(int i=1; i<=n; ++i) if(bit(mask,i-1))
{
if(f[mask][i]==-inf) continue;
for(int mask2=all^mask; mask2; mask2=(mask2-1)&(all^mask))
{
for(int j=1; j<=n; ++j) if(bit(mask2,j-1))
if(g[i][j]>0)
chk_max(f[mask|mask2][j], f[mask][i]+g[i][j]+cost[mask2]);
}
}
}
printf("%d",cost[all]-ans);
return 0;
} |
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#define MAXN 15
#define INF 0x3F3F3F3F
int v[MAXN][MAXN], n, m, x, y, z;
int c[1 << MAXN][MAXN], f[1 << MAXN][MAXN];
int main(){
scanf("%d%d", &n, &m);
for(int i = 0;i < m;i++){
scanf("%d%d%d", &x, &y, &z);
x--;y--;
v[x][y] = v[y][x] = z;
}
for(int d = 0;d < (1 << n);d++){
for(int i = 0;i < n;i++){
f[d][i] = INF;
for(int j = 0;j < n;j++)if((d >> j) & 1)c[d][i] += v[i][j];
}
}
f[1][0] = 0;
for(int d = 0;d < (1 << n);d++){
for(int i = 0;i < n;i++){
if(((d >> i) & 1) && f[d][i] != INF){
for(int j = 0;j < n;j++){
if(!((d >> j) & 1) && v[i][j]){
f[d | (1 << j)][j] = std::min(
f[d | (1 << j)][j],
f[d][i] + c[d][j] - v[i][j]
);
}
}
register int next = d ^ (1 << i), st = ((1 << n) - 1) ^ d, sum;
for(int j = st;j > 0;j = (j - 1) & st){
sum = 0;
for(int l = 0;l < n;l++)if((j >> l) & 1)sum += c[next][l];
f[d | j][i] = std::min(f[d | j][i], f[d][i] + sum);
}
}
}
}
printf("%d\n", f[(1 << n) - 1][n - 1]);
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
const int maxn=(1<<15)+5;
int n,m;
int dp[maxn][16];
int mp[16][16],val[maxn];
int main()
{
scanf("%d%d",&n,&m);
for(int i=1;i<=m;i++)
{
int u,v,w;
scanf("%d%d%d",&u,&v,&w);
mp[v][u]=mp[u][v]=w;
}
memset(dp,-1,sizeof(dp));
int all=(1<<n)-1;
dp[1][1]=0;
for(int s=0;s<=all;s++)
{
for(int i=1;i<=n;i++)
if(s&(1<<i-1))
{
for(int j=i+1;j<=n;j++)
if(s&(1<<j-1))val[s]+=mp[i][j];
}
for(int i=1;i<=n;i++)
if(s&(1<<i-1))
{
for(int s0=s;s0;s0=(s0-1)&s)if(((s^s0)&(1<<i-1))&&dp[s^s0][i]!=-1)dp[s][i]=max(dp[s^s0][i]+val[s0|(1<<i-1)],dp[s][i]);
for(int j=1;j<=n;j++)if((s&(1<<j-1))&&j!=i&&mp[j][i]&&dp[s^(1<<i-1)][j]!=-1)dp[s][i]=max(dp[s][i],dp[s^(1<<i-1)][j]+mp[j][i]);
}
}
printf("%d\n",val[all]-dp[all][n]);
} |
#pragma GCC optimize("Ofast")
#include<stdio.h>
#include<algorithm>
using namespace std;
int g[20][20]={0},cost[1<<15]={0},dp[1<<15][15];
int main(){
int i,j,k,n,m,a,b,c;
scanf("%d%d",&n,&m);
for(i=0;i<m;i++){
scanf("%d%d%d",&a,&b,&c);
g[a-1][b-1]=g[b-1][a-1]=c;
}
for(i=1;i<(1<<n);i++){
for(j=0;j<n;j++){
if(!(i>>j&1))
continue;
for(k=j+1;k<n;k++)
if(i>>k&1)
cost[i]+=g[j][k];
}
}
for(i=0;i<(1<<n);i++)
for(j=0;j<n;j++)
dp[i][j]=-1000000000;
for(i=0;i<(1<<n);i++)
dp[i][0]=cost[i];
for(i=0;i<(1<<n);i++){
for(j=1;j<n;j++){
if(!(i>>j&1))
continue;
for(k=0;k<n;k++)
if(k!=j&&(i>>k&1)&&g[j][k])
dp[i][j]=max(dp[i][j],dp[i^(1<<j)][k]+g[j][k]);
for(k=i;k;k=(k-1)&i)
dp[i][j]=max(dp[i][j],dp[i^k][j]+cost[k|(1<<j)]);
}
}
printf("%d\n",cost[(1<<n)-1]-dp[(1<<n)-1][n-1]);
} |
#include<bits/stdc++.h>
using namespace std;
#define MAXN (1<<15)+1
int n,m,a,b,c,sum[MAXN],f[MAXN][21],p[21][21],res,ans;
int main(){
scanf("%d%d",&n,&m);
int maxs=(1<<n)-1;
for(int i=1;i<=m;i++){
scanf("%d%d%d",&a,&b,&c);
p[a][b]=p[b][a]=c;
res+=c;
}
for(int s=0;s<=maxs;s++){
for(int i=1;i<=n;i++)
if(s&(1<<(i-1))){
for(int j=1;j<=n;j++)
if(s&(1<<(j-1))){
sum[s]+=p[i][j];
}
}
sum[s]>>=1;
}
memset(f,-1,sizeof(f));
f[1][1]=0;
for(int s=0;s<=maxs;s++){
for(int i=1;i<=n;i++){
if(f[s][i]==-1) continue;
for(int j=1;j<=n;j++){
if(s&(1<<(j-1))) continue;
if(!p[i][j]) continue;
f[s|(1<<(j-1))][j]=max(f[s|(1<<(j-1))][j],f[s][i]+p[i][j]);
}
int rest=(maxs^s)|(1<<(i-1));
for(int ss=rest;ss;ss=rest&(ss-1)){
f[s|ss][i]=max(f[s|ss][i],f[s][i]+sum[ss]);
}
}
}
int ans=0;
for(int i=0;i<=maxs;i++)
ans=max(ans,f[i][n]);
printf("%d\n",res-ans);
} |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
typedef vector<int> vi;
const int INF = (int)1e9;
int N, M;
vector<vi> G;
vector<vi> dp;
vi cost;
int total = 0;
int main(void) {
cin >> N >> M;
vi v0(N, 0);
G.resize(N, v0);
for (int i = 0; i < M; ++i) {
int a, b, c;
cin >> a >> b >> c;
G[a - 1][b - 1] = G[b - 1][a - 1] = c;
total += c;
}
cost.resize(1 << N, 0);
for (int i = 0; i < (1 << N); ++i) {
for (int j = 0; j < N; ++j) {
if ((i >> j) & 1) {
for (int k = j + 1; k < N; ++k) {
if ((i >> k) & 1)
cost[i] += G[j][k];
}
}
}
}
vi v1(N, -INF);
dp.resize(1 << N, v1);
for (int i = 0; i < (1 << N); ++i) {
if (i & 1)
dp[i][0] = cost[i];
}
for (int S = 0; S < (1 << N); ++S) {
for (int i = 0; i < N; ++i) {
if (dp[S][i] == -INF)
continue;
int sup = (~S) & ((1 << N) - 1);
int sub = sup;
for (int sub = sup; sub; sub = ((sub - 1) & sup)) {
for (int j = 0; j < N; ++j) {
if (G[i][j] != 0 && ((sub >> j) & 1))
dp[S | sub][j] = max(dp[S | sub][j], dp[S][i] + G[i][j] + cost[sub]);
}
}
}
}
int ans = total - dp[(1 << N) - 1][N - 1];
cout << ans << '\n';
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
const int INF = 1 << 30;
int N, M, all;
int mat[15][15];
int dp[1 << 15][15];
int LatteMalta[1 << 15];
int rec(int bit, int last)
{
if(~dp[bit][last]) return (dp[bit][last]);
if(last == N - 1 && bit == 0) return (0);
int ret = -INF;
for(int i = bit; i > 0; i = (i - 1) & bit) {
for(int j = 0; j < N; j++) {
if((i >> j) & 1) {
if(mat[last][j] == 0) continue;
auto p = rec(i ^ bit, j);
if(p == -INF) continue;
ret = max(ret, p + mat[last][j] + LatteMalta[i]);
}
}
}
return (dp[bit][last] = ret);
}
int main()
{
cin >> N >> M;
for(int i = 0; i < M; i++) {
int a, b, c;
cin >> a >> b >> c;
--a, --b;
mat[a][b] = mat[b][a] = c;
all += c;
}
int ret = -INF;
int mask = (1 << N) - 1;
for(int i = 0; i < (1 << N); i++) {
for(int j = 0; j < N; j++) {
for(int k = j + 1; k < N; k++) {
if((i >> j) & 1 && (i >> k) & 1) {
LatteMalta[i] += mat[j][k];
}
}
}
}
memset(dp, -1, sizeof(dp));
for(int i = 0; i < (1 << N); i++) {
if(i & 1) {
if(i & (1 << (N - 1))) continue;
ret = max(ret, rec(mask ^ i, 0) + LatteMalta[i]);
}
}
cout << all - ret << endl;
} |
#include<iostream>
#include<cstdio>
using namespace std;
int dp[66666][17][17],n,m,mp[17][17],xx,yy,zz,k,sum;
int main()
{
cin>>n>>m;
for (int i=1;i<=m;i++)
{
cin>>xx>>yy>>zz;
xx--;yy--;
mp[xx][yy]=zz;
mp[yy][xx]=zz;
}
for (int i=0;i<(1<<n);i++)
{
for (int j=0;j<n;j++)
{
for (int k=0;k<n;k++)
dp[i][j][k]=1e9;
}
for (int j=0;j<n;j++) dp[i][j][j]=0;
}
for (int i=1;i<(1<<n);i++)
{
for (int j=i;j;j=(j-1)&i)
{
if (!(j&1)) continue;
k=i^j;
sum=0;
for (int x=0;x<n;x++)
{
if (j&(1<<x))
{
for (int y=0;y<n;y++)
{
if (k&(1<<y)) sum+=mp[x][y];
}
}
}
int x=0;
for (int y=0;y<n;y++)
{
if (k&(1<<y))
{
for (int z=0;z<n;z++)
{
if (j&(1<<z) && mp[y][z])
{
dp[i][x][y]=min(dp[i][x][y],dp[j][x][z]+sum-mp[y][z]);
}
}
}
}
}
}
cout<<dp[(1<<n)-1][0][n-1]<<endl;
return 0;
} |
#include<iostream>
#include<cstring>
#include<cstdio>
using namespace std;
long long n,m,w[15][15],p[1<<15],dp[1<<15][15],sum,ans;
void init()
{
for(int i=0;i<1<<n;++i)
for(int j=0;j<n;++j) if(i>>j&1)
for(int k=j+1;k<n;++k) if(i>>k&1)
p[i]+=w[j][k];
}
int main()
{
ios::sync_with_stdio(false);
cin>>n>>m;
for(int i=1;i<=m;++i)
{
int x,y,t;
cin>>x>>y>>t;
--x;--y;
w[x][y]=t;
w[y][x]=t;
sum+=t;
}
init();
memset(dp,0xff,sizeof(dp));
dp[1][0]=0;
for(int i=0;i<1<<n;++i)
for(int j=0;j<n;++j) if(dp[i][j]!=-1)
{
int x=(1<<n)-1^i|1<<j;
for(int y=x;y>=0;--y)
y&=x,dp[i|y][j]=max(dp[i|y][j],dp[i][j]+p[y]);
for(int k=0;k<n;++k) if(!(i>>k&1)&&w[j][k]!=0)
dp[i|1<<k][k]=max(dp[i|1<<k][k],dp[i][j]+w[j][k]);
}
for(int i=0;i<1<<n;++i) ans=max(ans,dp[i][n-1]);
cout<<sum-ans<<endl;
return 0;
} |
#include <cstring>
#include <cstdio>
int val[15][15], sum[100005], dp[100005][15];
inline void upd(int &x, int y)
{
if (x < y)
x = y;
}
int main()
{
// freopen("ARC078-F.in", "r", stdin);
int n, m;
scanf("%d%d", &n, &m);
for (int i = 0; i < m; i++)
{
int u, v, w;
scanf("%d%d%d", &u, &v, &w);
val[--u][--v] = w;
val[v][u] = w;
}
for (int i = 0; i < 1 << n; i++)
{
for (int x = 0; x < n; x++)
{
for (int y = x; y < n; y++)
{
if ((i & (1 << x)) && (i & (1 << y)))
sum[i] += val[x][y];
}
}
}
memset(dp, -0x3f, sizeof(dp));
dp[1][0] = 0;
for (int s = 0; s < 1 << n; s++)
{
for (int i = 0; i < n; i++)
{
if (!(s & (1 << i)))
continue;
for (int j = 0; j < n; j++)
{
if ((s & (1 << j)) || !val[i][j])
continue;
upd(dp[s | (1 << j)][j], dp[s][i] + val[i][j]);
}
int x = (1 << n) - 1 ^ s;
for (int t = x; t; t = t - 1 & x)
upd(dp[s | t][i], dp[s][i] + sum[t | (1 << i)]);
}
}
printf("%d\n", sum[(1 << n) - 1] - dp[(1 << n) - 1][n - 1]);
return 0;
}
|
#pragma GCC optimize(1)
#pragma GCC optimize(2)
#pragma GCC optimize(3)
#include<bits/stdc++.h>
using namespace std;
#define chmax(a,b) if(a<b)a=b
const int N=17;
int n,m;
int g[N][N];
int cost[1<<N];
int dp[N][1<<N],dp2[1<<N];
int main()
{
scanf("%d%d",&n,&m);
while(m--)
{
int u,v,w;
scanf("%d%d%d",&u,&v,&w);
u--; v--;
g[u][v]=g[v][u]=w;
}
for(int mask=0;mask<(1<<n);mask++)
for(int u=0;u<n;u++)
for(int v=u+1;v<n;v++)
if(mask&(1<<u) && mask&(1<<v)) cost[mask]+=g[u][v];
memset(dp,-1,sizeof(dp));
for(int mask=1;mask<(1<<n);mask+=2)
dp[0][mask]=cost[mask];
for(int mask=1;mask<(1<<(n-1));mask+=2)
for(int i=0;i<n-1;i++) if(dp[i][mask]!=-1)
for(int j=0;j<n;j++)
{
if(!g[i][j]) continue;
if(mask&(1<<j)) continue;
chmax(dp[j][mask|(1<<j)],dp[i][mask]+g[i][j]);
}
memset(dp2,-1,sizeof(dp2));
for(int mask=1;mask<(1<<n);mask+=2)
dp2[mask]=dp[n-1][mask];
for(int mask=1+(1<<(n-1));mask<(1<<n);mask+=2) if(dp2[mask]!=-1)
for(int i=0;i<n;i++) if(mask&(1<<i))
{
int _=(1<<n)-1-mask;
for(int mask2=_;mask2>0;mask2=(mask2-1)&_)
chmax(dp2[mask|mask2],dp2[mask]+cost[mask2|(1<<i)]);
}
printf("%d\n",cost[(1<<n)-1]-dp2[(1<<n)-1]);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
#define repp(i,a,b) for(int i = (int)(a) ; i < (int)(b) ; ++i)
#define repm(i,a,b) for(int i = (int)(a) ; i > (int)(b) ; --i)
int main(){
int N,M; cin >> N >> M;
int s = 0;
vector<vector<int>> c(N,vector<int>(N,0));
repp(i,0,M){
int x,y,z; cin >> x >> y >> z;
--x; --y;
c[x][y] = c[y][x] = z;
s += z;
}
vector<int> d(1<<N,0);
repp(k,1,1<<N){
int i = 0;
while(!(k&(1<<i))) ++i;
d[k] = d[k^(1<<i)];
repp(j,i+1,N) if(k&(1<<j)) d[k] += c[i][j];
}
vector<vector<int>> dp(1<<N,vector<int>(N,-123456789));
dp[1][0] = 0;
repp(k,0,1<<(N-1)) repp(i,0,N-1) if((k*2+1)&(1<<i)) repp(j,1,N) if(!((k*2+1)&(1<<j))) if(c[i][j] > 0) dp[(k*2+1)^(1<<j)][j] = max(dp[(k*2+1)^(1<<j)][j],dp[k*2+1][i]+c[i][j]);
repp(k,0,1<<(N-1)){
for(int m = k ; m > 0 ; m = (m-1)&k){
dp[2*k+1][N-1] = max(dp[2*k+1][N-1],dp[2*(k^m)+1][N-1]+d[m*2+1]);
repp(i,0,N-1) if((m^k)&(1<<i)) dp[2*k+1][N-1] = max(dp[2*k+1][N-1],dp[2*(k^m)+1][N-1]+d[m*2+(1<<(i+1))]);
}
}
cout << s-dp[(1<<N)-1][N-1] << endl;
return 0;
}
|
#include <cstdio>
#include <algorithm>
using namespace std;
int N,M;
int C[16][16];
int dp[1<<15][16];
int F[1<<15][16];
int wut(int a,int b)
{
int rez=0;
for(int i=1;i<=N;i++)if((b>>(i-1))&1)rez+=F[a][i];
return rez;
}
int main()
{
scanf("%d %d",&N,&M);
for(int i=1;i<=M;i++){int x,y,z;scanf("%d %d %d",&x,&y,&z);C[x][y]=C[y][x]=z;}
for(int conf=0;conf<(1<<N);conf++)
{
for(int j=1;j<=N;j++)
{
dp[conf][j]=1<<30;
for(int k=1;k<=N;k++)
if((conf>>(k-1))&1)F[conf][j]+=C[k][j];
}
}
dp[1][1]=0;
for(int conf=1;conf<(1<<N);conf++)
{
for(int i=1;i<=N;i++)
{
if((conf>>(i-1))&1)
{
for(int j=1;j<=N;j++)
if(C[i][j]&&((conf>>(j-1))&1)==0)
dp[conf|(1<<(j-1))][j]=min(dp[conf|(1<<(j-1))][j],dp[conf][i]+F[conf^(1<<(i-1))][j]);
int u=(1<<N)-1-conf;
for(int p=u;p;p=(p-1)&u)
dp[conf|p][i]=min(dp[conf|p][i],dp[conf][i]+wut(conf^(1<<(i-1)),p));
}
}
}
printf("%d",dp[(1<<N)-1][N]);
return 0;
}
|
//Δ
#include<iostream>
#include<cstdio>
#include<fstream>
#include<algorithm>
#include<vector>
#include<map>
#include<set>
#include<queue>
#include<cmath>
#include<cstring>
#include<cstdlib>
using namespace std;
typedef long long LL;
typedef double DB;
const int N = 15;
const int M = 1<<N;
const int inf = 1e9;
inline void cmax(int& x,int y){
if(x<y)
x=y;
}
int n,m,a[N][N],b[M],f[M][N],t[M];
int main()
{
int i,j,k,x,y,z,s=0;
cin>>n>>m;
while(m--){
cin>>x>>y>>z;
x--,y--;
a[x][y]=z,a[y][x]=z;
for(i=0;i<(1<<n);i=i+1)
if(i&(1<<x))
if(i&(1<<y))
b[i]+=z;
s+=z;
}
m=(1<<n)-1;
for(i=0;i<=m;i=i+1){
for(x=0;x<n;x=x+1)
f[i][x]=-inf;
if(i&1)
f[i][0]=b[i];
}
for(x=0;x<n;x=x+1)
t[1<<x]=x;
for(i=0;i<=m;i=i+1){
for(x=0;x<n;x=x+1){
if(f[i][x]>=0){
z=m^i;
for(j=z;j;j=(j-1)&z){
for(k=j;k;k=k^(k&-k)){
y=t[k&-k];
if(a[x][y])
cmax(f[i|j][y],f[i][x]+a[x][y]+b[j]);
}
}
}
}
}
cout<<s-f[m][n-1];
return 0;
} |
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int Max_N(15);
inline void update(int &a, const int &b)
{
a = max(a, b);
}
int N, G[Max_N][Max_N], Sum[1 << Max_N];
void init()
{
int M;
scanf("%d%d", &N, &M);
int a, b, c;
while (M--)
scanf("%d%d%d", &a, &b, &c), --a, --b, G[a][b] = G[b][a] = c;
for (int S = 0;S < (1 << N);++S)
for (int i = 0;i <= N - 1;++i)
for (int j = i + 1;j <= N - 1;++j)
if ((S & (1 << i)) && (S & (1 << j)))
Sum[S] += G[i][j];
}
//等价于最大化保留的边权和，使得1 ~ n的路径上所有边都是桥边
//最优方案一定是一个1 ~ n的路径上，每个点挂一些集合
//F[S][i]表示目前dp到1 ~ i的路径，满足1 ~ i的路径上所有边都是桥边，用到的点的集合是S
//转移考虑增加一条桥边还是新挂一个集合
int F[1 << Max_N][Max_N];
void dp()
{
memset(F, -0X3F, sizeof(F));
F[1 << 0][0] = 0;
for (int S = 0;S < (1 << N);++S)
for (int last = 0;last <= N - 1;++last)
if (S & (1 << last))
{
for (int now = 0;now <= N - 1;++now)
if ((S & (1 << now)) == 0 && G[last][now])
update(F[S | (1 << now)][now], F[S][last] + G[last][now]);
for (int S0 = ((1 << N) - 1) - S;S0;S0 = ((S0 - 1) & ((1 << N) - 1 - S)))
update(F[S | S0][last], F[S][last] + Sum[S0 + (1 << last)]);
}
printf("%d", Sum[(1 << N) - 1] - F[(1 << N) - 1][N - 1]);
}
int main()
{
init();
dp();
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int read()
{
int x=0,f=1; char ch=getchar();
while(ch<'0'||ch>'9') {if(ch=='-') f=-1; ch=getchar();}
while(ch>='0'&&ch<='9') {x=(x<<3)+(x<<1)+(ch^48); ch=getchar();}
return x*f;
}
int n,m,x,y,z;
int dis[20][20];
int tag[20],s[100050];
int f[100050][20],sum,ans;
int main()
{
n=read(); m=read(); tag[0]=-1;
memset(f,-1,sizeof(f)); f[1][0]=0;
while(m--)
{
x=read()-1; y=read()-1; z=read();
dis[x][y]=dis[y][x]=z; sum+=z;
}
for(int i=1;i<(1<<n);++i)
{
//x=tag[i]=tag[i>>1]+1; s[i]=s[i^(1<<x)];
//for(y=0;y<x;++y)
// if(i&(1<<y)) s[i]+=dis[x][y];
for(int j=0;j<n;++j)
for(int k=0;k<n;++k)
if((i&(1<<j))&&(i&(1<<k)))
s[i]+=dis[j][k];
s[i]>>=1;
}
for(int i=1;i<(1<<n);++i)
for(int j=0;j<n;++j)
{
if(f[i][j]==-1) continue;
for(int k=0;k<n;++k)
if(dis[j][k]&&!(i&(1<<k)))
f[i|(1<<k)][k]=max(f[i|(1<<k)][k],f[i][j]+dis[j][k]);
int t=((1<<n)-1)^i^(1<<j);
for(int k=t;k;k=(k-1)&t)
f[i|k][j]=max(f[i|k][j],f[i][j]+s[k]);
}
for(int i=0;i<(1<<n);++i)
ans=max(ans,f[i][n-1]);
printf("%d",sum-ans);
return 0;
} |
#include<cstdio>
#include<cstring>
#include<algorithm>
#define N 20
using namespace std;
int n, m, map[N][N], x, y, z, w[32770], bin[N], f[32770][N], ans, s, ss;
int main(){
scanf("%d%d", &n, &m);
memset(map, 0, sizeof(map));
for(int i=1; i<=m; i++){scanf("%d%d%d", &x, &y, &z); map[x][y]=map[y][x]=z;}
bin[0]=1; for(int i=1; i<=n; i++)bin[i]=bin[i-1]<<1;
for(int i=0; i<=bin[n]-1; i++){
w[i]=0;
for(int j=1; j<=n; j++)if(i&bin[j-1])
for(int k=j+1; k<=n; k++)if(i&bin[k-1])w[i]+=map[j][k];
}
memset(f, -1, sizeof(f));
for(int i=1; i<=bin[n]-1; i++)if(i&bin[0])
for(int j=1; j<=n; j++)if(i&bin[j-1]){
if(j==1){f[i][j]=w[i]; continue;}
s=i-bin[j-1];
for(int k=1; k<=n; k++)if(j!=k&&i&bin[k-1]&&map[k][j]){
x=k>=2?bin[0]+bin[k-1]:bin[0];
s-=x;
for(int s1=s; s1>=0; s1=(s1-1)&s){
ss=s1+x; if(f[ss][k]>=0)f[i][j]=max(f[i][j], f[ss][k]+w[i-ss]+map[k][j]);
if(!s1)break;
}
s+=x;
}
}
ans=-f[bin[n]-1][n];
for(int i=1; i<=n; i++)
for(int j=i+1; j<=n; j++)ans+=map[i][j];
printf("%d", ans);
return 0;
} |
#include <bits/stdc++.h>
#define N 20
#define N2 65634
using namespace std;
int V, E;
int i, u, v, w;
int G[N][N];
int f[N2][N];
int in[N2], out[N][N2], ans;
void up(int &x, const int y) {x < y ? x = y : 0;}
int main(){
scanf("%d%d", &V, &E);
for(i = 0; i < E; ++i){
scanf("%d%d%d", &u, &v, &w); --u; --v;
G[u][v] = G[v][u] = w; ans += w;
}
for(i = 0; i < 1 << V; ++i)
for(u = 0; u < V; ++u) if(i >> u & 1)
for(v = u + 1; v < V; ++v) if(i >> v & 1)
in[i] += G[u][v];
for(i = 0; i < 1 << V; ++i)
for(u = 0; u < V; ++u) if(!(i >> u & 1))
for(v = 0; v < V; ++v) if(i >> v & 1)
out[u][i] += G[u][v];
memset(f, 128, sizeof f);
f[1][0] = 0;
for(i = 1; i < 1 << V; ++i)
for(u = 0; u < V; ++u) if((i >> u & 1) && f[i][u] >= 0){
for(v = 0; v < V; ++v) if(!(i >> v & 1) && G[u][v])
up(f[i | 1 << v][v], f[i][u] + G[u][v]);
v = ~(-1 << V | i);
for(; v; v = v - 1 & ~i)
up(f[i | v][u], f[i][u] + out[u][v] + in[v]);
}
printf("%d\n", ans -= f[(1 << V) - 1][V - 1]);
return 0;
} |
#include <bits/stdc++.h>
#define ll long long
#define INF 999999999
#define MOD 1000000007
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
typedef pair<int,int>P;
const int MAX_N = 100005;
vector<P> lens[100005];
int bit[MAX_N+1],n,m;
//i番目までの和を計算する
int sum(int i)
{
int s = 0;
while(i>0){
s += bit[i];
i -= i & -i;
}
return s;
}
//i番目の値にxを加える
void add(int i,int x)
{
while(i <= MAX_N){
bit[i] += x;
i += i & -i;
}
}
int main()
{
scanf("%d%d",&n,&m);
rep(i,n){
int l,r;
scanf("%d%d",&l,&r);
r++;
lens[r-l].push_back(P(l,r)); //rはr+1を指すようにする
}
printf("%d\n",n);
int rest = n;
for(int i=2;i<m+1;i++){ //iは間隔dのこと
rep(j,lens[i-1].size()){
add(lens[i-1][j].first,1);
add(lens[i-1][j].second,-1);
rest--;
}
int ans = rest; //間隔がm以上の区間
int it = i;
while(it<=m){
ans += sum(it);
it += i;
}
printf("%d\n",ans);
}
}
|
#include<bits/stdc++.h>
using namespace std;
const int maxn=1e5+10;
int d[maxn],n,m,l,r;
int main()
{
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++){
scanf("%d%d",&l,&r);
for(int a=1,b;a<=l-1;a=b+1){
b=(l-1)/((l-1)/a);
int y=(l-1)/a;
int L=a,R=min(r/(y+1),b);
//cout<<L<<" "<<R<<endl;
d[L]+=1,d[R+1]-=1;
}
d[l]+=1,d[r+1]-=1;
}
for(int i=1;i<=m;i++){
d[i]=d[i-1]+d[i];
printf("%d\n",d[i]);
}
}
|
#include <bits/stdc++.h>
#define EB emplace_back
typedef std::vector <int> vector;
const int N = 300054;
int n, R;
int x[N];
vector left[N];
int sum(int h) {int s = 0; for (; h; h &= h - 1) s += x[h]; return s;}
void add(int h, int v) {for (; h <= R; h |= h - 1, ++h) x[h] += v;}
int main() {
int i, j, l, r, ans;
scanf("%d%d", &n, &R);
for (i = 0; i < n; ++i) scanf("%d%d", &l, &r), left[r - l + 1].EB(l);
for (i = 1; i <= R; ++i) {
for (ans = n, j = i; j <= R; j += i) ans += sum(j);
printf("%d\n", ans);
for (int le : left[i]) add(le, 1), add(le + i, -1), --n;
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 3e5 + 5;
int n, m;
int t[maxn];
struct data {
int l, r, len;
bool friend operator < (const data &a, const data &b) {
return a.len < b.len;
}
} a[maxn];
void add(int p, int d) {
for(; p <= m; p += p & -p) {
t[p] += d;
}
}
int query(int p) {
int ret = 0;
for(; p; p -= p & -p) {
ret += t[p];
}
return ret;
}
int main() {
scanf("%d%d", &n, &m);
for(int i = 1; i <= n; ++i) {
scanf("%d%d", &a[i].l, &a[i].r);
a[i].len = a[i].r - a[i].l + 1;
}
sort(a + 1, a + n + 1);
for(int i = 1, j = 1; i <= m; ++i) {
while(j <= n && a[j].len < i) {
add(a[j].l, 1);
add(a[j].r + 1, -1);
++j;
}
int ans = n - j + 1;
for(int j = i; j <= m; j += i) {
ans += query(j);
}
printf("%d\n", ans);
}
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
#define N 1111116
int n,m,f[N];
vector<int> q[N];
void modify(int x,int t){
if (x>m) return;
f[x]+=t;modify(x+(x&-x),t);
}
int query(int x){
if (!x) return 0;
return f[x]+query(x-(x&-x));
}
int read(){
int x=0,f=1;char ch=getchar();
for (;!isdigit(ch);ch=getchar()) if (ch=='-') f=-f;
for (;isdigit(ch);ch=getchar()) x=x*10+ch-'0';
return x*f;
}
int main(){
n=read();m=read();
for (int i=1;i<=n;i++){
int l=read(),r=read();
q[r-l+1].push_back(l);
}
for (int i=1;i<=m;i++){
for (int j=0;j<(int)q[i].size();j++)
modify(q[i][j],1),modify(q[i][j]+i,-1);
n-=q[i].size();
int ans=0;
for (int j=i;j<=m;j+=i)
ans+=query(j);
printf("%d\n",n+ans);
}
return 0;
} |
#include<bits/stdc++.h>
#define N 300005
using namespace std;
int val[N];
int n,m;
void solve(int l,int r){
if(l==0) {
val[1]++,val[r+1]--;
return;
}//(]
for(int i=1,ne,lastl=1e9;i<=r;i=ne+1){
if(i<=l) ne=min(l/(l/i),r/(r/i));
else ne=r;
if(l/i<lastl){
val[l/i+1]++,val[min(lastl,r/i)+1]--;
lastl=l/i;
}
}
}
int main(){
scanf("%d%d",&n,&m);
for(int i=1,l,r;i<=n;i++){
scanf("%d%d",&l,&r);
solve(l-1,r);
}
for(int i=1;i<=m;i++) printf("%d\n",val[i]+=val[i-1]);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
struct node{int l,r,len;}a[300010];
int n,m,t[100010];
bool cmp(node x,node y){return x.len<y.len;}
void modify(int x,int k){for (; x<=m; t[x]+=k,x+=x&-x);}
int ask(int x){int s=0; for (; x; s+=t[x],x-=x&-x); return s;}
void work()
{
scanf("%d %d",&n,&m);
for (int i=1; i<=n; i++)
scanf("%d %d",&a[i].l,&a[i].r),a[i].len=a[i].r-a[i].l+1;
sort(a+1,a+n+1,cmp);
for (int i=1,j=1,ans; i<=m; i++)
{
while ((j<=n)&&(a[j].len<i)) modify(a[j].l,1),modify(a[j].r+1,-1),j++;
ans=n-j+1;
for (int k=i; k<=m; k+=i) ans+=ask(k);
printf("%d\n",ans);
}
}
int main()
{
work();
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
template<class T> void read(T &x)
{
x=0;int f=0;char ch=getchar();
while(ch<'0'||ch>'9') f=ch=='-',ch=getchar();
while(ch>='0'&&ch<='9') x=(x<<1)+(x<<3)+(ch^48),ch=getchar();
x=f?-x:x;
}
const int N=3e5+5;
struct node{
int l,r,len;
bool operator < (const node &A) const {return len<A.len;}
}a[N];
int tree[N<<1],n,m;
inline void add(int x,int v)
{
for(;x<=m;x+=x&-x) tree[x]+=v;
}
inline int query(int x)
{
int res=0;
for(;x>0;x-=x&-x) res+=tree[x];
return res;
}
int main()
{
read(n),read(m);
for(int i=1;i<=n;i++)
read(a[i].l),read(a[i].r),a[i].len=a[i].r-a[i].l+1;
sort(a+1,a+n+1);
int k=1;
for(int i=1;i<=m;i++)
{
int ans=0;
while(k<=n&&a[k].len<=i)
add(a[k].l,1),add(a[k].r+1,-1),k++;
for(int j=i;j<=m;j+=i)
ans+=query(j);
printf("%d\n",ans+n-k+1);
}
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
const int N=3e5+5;
int sum[N];
int main(){
int n,m;
scanf("%d%d",&n,&m);
for(int i=1;i<=n;++i){
int l,r;
scanf("%d%d",&l,&r);
sum[l]++; sum[r+1]--; l--;
for(int j=1,nxt;j<=l;j=nxt+1){
nxt=min(l/(l/j),r/(r/j));
if(l/j<r/j) sum[j]++,sum[nxt+1]--;
}
}
for(int i=1;i<=m;++i){
sum[i]+=sum[i-1];
printf("%d\n",sum[i]);
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 3e5 + 10;
const int maxm = 1e5 + 10;
int n, m, g;
int ans[maxm], delta[maxm];
struct seg
{
int l, r;
}a[maxn];
int main()
{
scanf("%d%d", &n, &m);
g = sqrt(m);
for(int i = 1; i <= n; ++i)
{
scanf("%d%d", &a[i].l, &a[i].r);
--a[i].l;
}
for(int i = 1; i <= g; ++i)
{
for(int j = 1; j <= n; ++j)
if(a[j].l / i != a[j].r / i)
++ans[i];
}
for(int i = m / (g + 1); ~i; --i)
{
for(int j = 1; j <= n; ++j)
{
int l = max(g + 1, a[j].r / (i + 1) + 1) , r = i == 0 ? m : a[j].l / i;
if(l > r) continue;
delta[l]++;
delta[r + 1]--;
}
}
for(int i = g + 1; i <= m; ++i)
{
delta[i] += delta[i - 1];
ans[i] = n - delta[i];
}
for(int i = 1; i <= m; ++i)
printf("%d ", ans[i]);
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int N, M;
int bit[1000010];
vector<pair<long long, long long> >range[100005];
void add(int a, int w){
for(int x = a; x < 1000010; x += x & -x){
bit[x] += w;
}
}
int sum(int a){
int ret = 0;
for(int x = a; x > 0; x -= x & -x){
ret += bit[x];
}
return ret;
}
int main(){
cin >> N >> M;
for(long long i = 0; i < N; i++){
long long l, r;
cin >> l >> r;
range[r-l+1].push_back(make_pair(l, r));
}
for(long long d = 1; d <= M; d++){
//add range d - 1, N--;
for(int i = 0; i < range[d].size(); i++){
add(range[d][i].first, 1);
add(range[d][i].second + 1, -1);
N--;
}
long long ans = N;
for(long long cur = d; cur <= M; cur += d){
ans += sum(cur);
}
cout << ans << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
vector<pair<int, int>> a[100005];
int bit[100005];
void add(int x, int d) {
for (; x <= 100000; x += (x & -x)) {
bit[x] += d;
}
}
int sum(int x) {
if (x == 0) return 0;
int s = 0;
for (; x >= 1; x -= (x & -x)) {
s += bit[x];
}
return s;
}
int main() {
int n, m, l, r;
scanf("%d %d", &n, &m);
for (int i = 0; i < n; i++) {
scanf("%d %d", &l, &r);
a[r - l + 1].push_back({l, r});
}
for (int i = 1; i <= m; i++) {
int ans = n;
for (int j = i; j <= m; j += i) {
ans += sum(j);
}
for (auto p : a[i]) {
add(p.first, 1);
add(p.second + 1, -1);
n--;
}
printf("%d\n", ans);
}
return 0;
}
|
#include<cstdio>
#include<cctype>
#include<algorithm>
const int N=300007,M=100007;
int read(){int x=0,c=getchar();while(!isdigit(c))c=getchar();while(isdigit(c))x=x*10+c-48,c=getchar();return x;}
struct node{int l,r;}a[N];
int n,m,ans[M],t[M];
void add(int p,int v){for(;p<=m;p+=p&-p)t[p]+=v;}
void upd(int l,int r){add(l,1);if(r<m)add(r+1,-1);}
int ask(int p){int s=0;for(;p;p^=p&-p)s+=t[p];return s;}
int main()
{
n=read(),m=read();
for(int i=1;i<=n;++i) a[i].l=read(),a[i].r=read();
std::sort(a+1,a+n+1,[](node&a,node&b){return a.r-a.l<b.r-b.l;});
for(int i=1,p=1,s;i<=m;++i)
{
for(s=0;p<=n&&a[p].r-a[p].l<i;++p) upd(a[p].l,a[p].r);
for(int j=i;j<=m;j+=i) s+=ask(j);
printf("%d\n",n-p+1+s);
}
}
|
#include<cstdio>
#include<cstring>
#include<algorithm>
#define rep(a,b,c) for (int a=b;a<=c;a++)
#define per(a,b,c) for (int a=b;a>=c;a--)
#define go(u) for (int o=ft[u],v;v=E[o].t;o=E[o].n)
#define fi first
#define se second
using namespace std;
typedef long long LL;
typedef pair<int,int> par;
const int N=300010;
int ft[N],a[N],ans[N],n,m,tot;
struct edge{int t,n;}E[N];
void adde(int x,int y){
E[++tot]=(edge){y,ft[x]},ft[x]=tot;
}
int ask(int x){
int s=0;
for (;x;x-=x&-x) s+=a[x];
return s;
}
void add(int x,int k){
for (;x<=n+5;x+=x&-x) a[x]+=k;
}
int main(){
scanf("%d%d",&m,&n);
rep(i,1,m){
int x,y;
scanf("%d%d",&x,&y);
adde(y-x+1,x);
}
int sum=m;
rep(i,1,n){
ans[i]=sum;
for (int j=i;j<=n;j+=i) ans[i]+=ask(j);
go(i){
--sum;
int x=v,y=v+i;
add(x,1);
add(y,-1);
}
printf("%d\n",ans[i]);
}
return 0;
}
|
#include<cstdio>
#include<algorithm>
#include<vector>
using namespace std;
vector<int>E[101000];
int n, m, BIT[101000];
void Add(int a, int b){while(a <= n){BIT[a] += b; a += (a&-a);}}
int Sum(int a){int r = 0;while(a){r += BIT[a]; a -= (a&-a);}return r;}
int main(){
int i, a, b, j;
scanf("%d%d",&m,&n);
for(i=1;i<=m;i++){
scanf("%d%d",&a,&b);
E[b-a+1].push_back(a);
}
int R = m;
for(i=1;i<=n;i++) {
for(j=0;j<E[i].size();j++){
Add(E[i][j], 1);
Add(E[i][j]+i, -1);
R--;
}
int r = 0;
for(j=i;j<=n;j+=i) r += Sum(j);
printf("%d\n",R+r);
}
} |
#include <iostream>
#include <utility>
#include <algorithm>
using namespace std;
int N, M;
pair< int, pair<int, int> > range[300005];
int bit[300005];
int query(int i)
{
int ret = 0;
while(i > 0){
ret += bit[i];
i -= i & (-i);
}
return ret;
}
void add(int i, int val)
{
while(i <= M+1){
bit[i] += val;
i += i & (-i);
}
}
int main(void)
{
cin >> N >> M;
int l, r;
for(int i = 0; i < N; i++){
cin >> l >> r;
range[i] = make_pair(r-l+1, make_pair(l, r));
}
sort(range, range+N);
int p = 0;
for(int i = 1; i <= M; i++){
while(p < N && range[p].first < i){
add(range[p].second.first, 1);
add(range[p].second.second + 1, -1);
p++;
}
int ans = 0;
for(int j = i; j <= M; j+=i) ans += query(j);
cout << ans + (N - p) << endl;
}
return 0;
} |
#include <bits/stdc++.h>
#define s second
using T=std::pair<int,int>;
T*P=new T[1<<19],*p;
int BIT[1<<17],j,k,l,r,x,M;
int main(){
p=P;
while(~scanf("%d%d",&p->first,&p->s)) p++;
M=P->s;
++P;
sort(P,p,[](T a,T b){return a.s-a.first<b.s-b.first;});
--p;
while(x++<M){
while(std::tie(l,r)=*P, l&&r-l<x){
for(j=l; j<=M; j+=j&-j) BIT[j]++;
for(j=r+1; j<=M; j+=j&-j) BIT[j]--;
P++;
}
k=p-P;
for(j=0; j<=M; j+=x) {
for(l=j; l; l-=l&-l)
k+=BIT[l];
}
printf("%d\n",k+1);
}
j=0;
} |
#include <cstdio>
#include <algorithm>
using namespace std;
#define N 2000000
#define M 100050
int n,m,i,j,c[M],b[M];
struct lwn{
int l,r,opt;
bool operator < (const lwn &jb)const{
return r<jb.r||r==jb.r&&opt<jb.opt;
}
} a[N];
inline int rd()
{
char ch=getchar();int ret=0;
while (ch<'0' || ch>'9') ch=getchar();
while (ch>='0' && ch<='9') ret=(ret<<3)+(ret<<1)+ch-'0',ch=getchar();
return ret;
}
int main()
{
n=rd();m=rd();int q=n;
for (i=1;i<=n;i++) a[i].l=rd(),a[i].r=rd();
for (i=1;i<=m;i++)
for (j=0;j<=m/i;j++) n++,a[n].l=i*j,a[n].r=min(i*(j+1)-1,m),a[n].opt=i;
sort(a+1,a+n+1);int psz=0;
for (i=1;i<=n;i++) if (a[i].opt){
int tot=0;
for (j=a[i].l;j>=1;j-=(j&(-j))) tot+=c[j];
b[a[i].opt]+=psz-tot;
}else{
psz++;
for (j=a[i].l;j<=m;j+=(j&(-j))) c[j]++;
}
for (i=1;i<=m;i++) printf("%d\n",q-b[i]);
return 0;
} |
#include<bits/stdc++.h>
#define maxn 300100
using namespace std;
struct data{
int l,r,len;
data(){}
data(int l,int r):l(l),r(r),len(r-l+1){}
int operator<(const data& d)const{return len<d.len;}
}d[maxn];
int tr[maxn],n,m;
void add(int x,int a){for(;x<=m;x+=x&-x)tr[x]+=a;}
int qry(int x){int ans=0;for(;x;x-=x&-x)ans+=tr[x];return ans;}
int main(){
scanf("%d%d",&n,&m);
for(int i=1;i<=n;++i)
scanf("%d%d",&d[i].l,&d[i].r),d[i].len=d[i].r-d[i].l+1;
sort(d+1,d+n+1);
for(int i=1,l=1;i<=m;++i){
while(l<=n&&d[l].len<i)
add(d[l].l,1),add(d[l].r+1,-1),l++;
int ans=n-l+1;
for(int j=i;j<=m;j+=i)
ans+=qry(j);//,printf("[%d]",qry(j));
printf("%d\n",ans);
}
} |
#include <bits/stdc++.h>
#define L(x) ((x) & -(x))
std::vector<int> e[' '];
int n, m, s[' '], a;
void U(int x, int u) {
while (x <= n)
s[x] += u, x += L(x);
}
int Q(int x) {
int r = 0;
while (x)
r += s[x], x -= L(x);
return r;
}
int main() {
scanf("%d%d", &m, &n);
for (int i = 1, l, r; i <= m; i++)
scanf("%d%d", &l, &r), e[r - l + 1].push_back(l);
for (int d = 1; d <= n; d++) {
a = m;
for (int i = d; i <= n; i += d)
a += Q(i);
for (int u : e[d])
U(u, 1), U(u + d, -1), m--;
printf("%d\n", a);
}
return 0;
} |
#include <algorithm>
#include <cstdio>
struct data
{
int l, r, len;
inline bool operator <(const data &a) const
{
return len < a.len;
}
} arr[300005];
int sum[100005], n, m;
inline void modify(int pos, int x)
{
for (; pos <= m; pos += pos & -pos)
sum[pos] += x;
}
inline int query(int pos)
{
int res = 0;
for (; pos; pos -= pos & -pos)
res += sum[pos];
return res;
}
int main()
{
// freopen("ARC068-E.in", "r", stdin);
scanf("%d%d", &n, &m);
for (int i = 0; i < n; i++)
{
scanf("%d%d", &arr[i].l, &arr[i].r);
arr[i].len = arr[i].r - arr[i].l + 1;
}
std::sort(arr, arr + n);
for (int i = 1, cur = 0; i <= m; i++)
{
while (cur < n && arr[cur].len <= i)
{
modify(arr[cur].l, 1);
modify(arr[cur].r + 1, -1);
cur++;
}
int ans = 0;
for (int j = i; j <= m; j += i)
ans += query(j);
printf("%d\n", ans + n - cur);
}
return 0;
}
|
#include<cstdio>
#include<cstring>
#include<vector>
#include<algorithm>
using namespace std;
int n,m,l[310000],r[310000],tree[110000];
vector<int> vec[110000];
void add(int x,int y){
for (;x<=m;x+=x&-x) tree[x]+=y;
}
int getsum(int x){
int sum=0;
for (;x;x-=x&(-x)) sum+=tree[x];
return sum;
}
int main(){
scanf("%d%d",&n,&m);
for (int i=1;i<=n;i++){
scanf("%d%d",&l[i],&r[i]);
vec[r[i]-l[i]+1].push_back(i);
}
for (int i=1;i<=m;i++){
int ans=0;
for (int j=0;j<(int)vec[i].size();j++)
add(l[vec[i][j]],1),add(r[vec[i][j]]+1,-1);
for (int j=i;j<=m;j+=i) ans+=getsum(j);
n-=vec[i].size();
printf("%d\n",ans+n);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 3.1e5;
const int MAXM = 1.1e5;
int N, M;
int bit[MAXM];
void update(int i) {
for (i++; i <= M+1; i += (i & -i)) {
bit[i]++;
}
}
int query(int i) {
int s = 0;
for (; i; i -= (i & -i)) {
s += bit[i];
}
return s;
}
int query(int l, int r) {
return query(r) - query(l);
}
vector<int> facs[MAXM];
vector<int> rights[MAXM];
int ans[MAXM];
int main() {
ios::sync_with_stdio(0), cin.tie(0);
cin >> N >> M;
for (int i = 0; i < N; i++) {
int l, r; cin >> l >> r;
rights[l].push_back(r);
}
for (int d = 1; d <= M; d++) {
for (int v = d; v <= M; v += d) {
facs[v].push_back(d);
}
}
for (int v = 1; v <= M; v++) {
for (int r : rights[v]) {
update(r);
}
for (int d : facs[v]) {
ans[d] += query(v, min(M+1, v+d));
}
}
for (int d = 1; d <= M; d++) {
cout << ans[d] << '\n';
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define PI 4*atan(1)
#define INF 1e8
int dx[4] = {1,0,-1,0};
int dy[4] = {0,1,0,-1};
int bit[300001] = {0};
int sum(int i){
int s = 0;
while(i > 0){
s += bit[i];
i -= i & -i;
}
return s;
}
void add(int i, int x, int M){
while(i <= M){
bit[i] += x;
i += i & -i;
}
}
int main(){
int N, M;
cin >> N >> M;
vector<int> l(N + 1, 0), r(N + 1, 0);
map<int, vector<pair<int, int>>> len;
for(int i = 1; i <= N; i++){
cin >> l[i] >> r[i];
len[r[i] - l[i] + 1].emplace_back(l[i], r[i]);
}
int n = N;
for(int i = 1; i <= M; i++){
int d = i;
for(pair<int, int> p : len[d]){
add(p.first, 1, M + 1);
add(p.second + 1, -1, M + 1);
n--;
}
int s = 0;
for(int j = 0; j <= M; j+=d){
s += sum(j);
}
cout << s + n << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 3e5 + 10;
const int MAXM = 1e5 + 10;
int n, m, bit[MAXM];
struct Triple {
int l, r, len;
Triple() {}
Triple(int _l, int _r, int _len) : l(_l), r(_r), len(_len) {}
} a[MAXN];
inline bool cmp(const Triple &x, const Triple &y) {
return x.len < y.len;
}
void add(int x, int v) {
for (; x <= m; x += x & -x)
bit[x] += v;
}
int get(int x) {
int r = 0;
for (; x; x -= x & -x)
r += bit[x];
return r;
}
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; ++i) {
int l, r;
scanf("%d%d", &l, &r);
a[i] = Triple(l, r, r - l + 1);
}
sort(a + 1, a + n + 1, cmp);
int ptr = 1;
for (int i = 1; i <= m; ++i) {
for (; ptr <= n && a[ptr].len < i; ++ptr) {
add(a[ptr].l, 1);
add(a[ptr].r + 1, -1);
}
int ans = n - ptr + 1;
for (int j = i; j <= m; j += i)
ans += get(j);
printf("%d\n", ans);
}
} |
#include<stdio.h>
#include<algorithm>
#define N (300010)
int d[N],l[N],r[N],n,m,p[N];
struct ds{
int c[N];
void add(int x, int y ,int a){
for (;x<N;x+=x&-x){
c[x]+=a;
}
for (y++;y<N;y+=y&-y){
c[y]-=a;
}
}
int sum(int x){
int res=0;
for (;x;x-=x&-x){
res+=c[x];
}
return res;
}
void init(void){
for (int i=0;i<N;i++){
c[i]=0;
}
}
} c2;
bool cmp(int &a, int &b){
return d[a]<d[b];
}
int main(){
scanf("%d%d",&n,&m);
for (int i=1;i<=n;i++){
scanf("%d%d",l+i,r+i);
d[i]=r[i]-l[i]+1;
p[i]=i;
}
std::sort(p+1,p+n+1,cmp);
c2.init();
for (int i=1,rr=1;i<=m;i++){
while (rr<=n&&d[p[rr]]<i){
c2.add(l[p[rr]],r[p[rr]],1);
rr++;
}
int ans=n-rr+1;
for (int j=i;j<=m;j+=i){
ans+=c2.sum(j);
}
printf("%d\n",ans);
}
} |
#include<bits/stdc++.h>
#define reg register
typedef long long ll;
using namespace std;
const int MN=3e5+5;
int n,m,L[MN],R[MN],id[MN];
int d[MN];
#define lowbit(x) (x&-x)
inline void update(int x,int v){while(x<=m)d[x]+=v,x+=lowbit(x);}
inline void update(int l,int r,int v){update(l,v);update(r+1,-v);}
inline int query(int x){reg int res=0;while(x)res+=d[x],x-=lowbit(x);return res;}
int main(){
scanf("%d%d",&n,&m);
for(reg int i=1;i<=n;i++)scanf("%d%d",L+i,R+i),id[i]=i;
sort(id+1,id+1+n,[](int a,int b){
return R[a]-L[a]<R[b]-L[b];
});
reg int cur=1,Ans;
for(reg int d=1;d<=m;d++){
while(cur<=n&&R[id[cur]]-L[id[cur]]+1<d)
update(L[id[cur]],R[id[cur]],1),cur++;
Ans=n-cur+1;
for(reg int i=d;i<=m;i+=d)Ans+=query(i);
printf("%d\n",Ans);
}
return 0;
} |
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
int n,m;
struct node{int l,r;}a[300010];
bool cmp(node x,node y){return x.r-x.l<y.r-y.l;}
int tree[100010];
void add(int id,int x){for(;id<=m;id+=id&-id) tree[id]+=x;}
int query(int id){int re=0;for(;id;id-=id&-id) re+=tree[id];return re;}
int main()
{
scanf("%d%d",&n,&m);
for (int i=1;i<=n;i++) scanf("%d%d",&a[i].l,&a[i].r);
sort(a+1,a+n+1,cmp);
for (int i=1,j=1;i<=m;i++)
{
while (j<=n&&a[j].r-a[j].l<i)
{
add(a[j].l,1);
add(a[j].r+1,-1);
j++;
}
int cnt=0;
for (int t=i;t<=m;t+=i) cnt+=query(t);
printf("%d\n",cnt+n-j+1);
}
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N = 3e5 + 10, M = 1e5 + 10;
int n, m;
int l[N], r[N], idx[N], len[N];
int a[M];
bool cmp(int x, int y) {
return len[x] < len[y];
}
void add(int x, int v) {
for (; x <= m + 1; x += x & -x) a[x] += v;
}
int query(int x) {
int ret = 0;
for (; x; x -= x &-x) ret += a[x];
return ret;
}
int main() {
scanf("%d%d", &n, &m);
for (int i = 0; i < n; i++) {
scanf("%d%d", l + i, r + i);
len[i] = r[i] - l[i] + 1;
idx[i] = i;
}
sort(idx, idx + n, cmp);
int j = 0;
for (int i = 1; i <= m; i++) {
while (j < n && len[idx[j]] < i) {
add(l[idx[j]], 1);
add(r[idx[j]]+1, -1);
j++;
}
int ans = 0;
for (int k = i; k <= m; k += i) ans += query(k);
printf("%d\n", ans + n - j);
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
const int N=400005;
int n,m,c[N];
struct data{
int l,r;
}a[N];
bool cmp(data a,data b){
return a.r-a.l+1<b.r-b.l+1;
}
void add(int i,int v){
i++;
while(i<=m+1){
c[i]+=v;
i+=i&(-i);
}
}
int sum(int i){
i++;
int res=0;
while(i){
res+=c[i];
i-=i&(-i);
}
return res;
}
int main(){
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++){
scanf("%d%d",&a[i].l,&a[i].r);
}
sort(a+1,a+n+1,cmp);
int now=0;
for(int i=1;i<=m;i++){
int ans=n-now;
for(int j=i;j<=m;j+=i){
ans+=sum(j);
}
printf("%d\n",ans);
while(now<n&&a[now+1].r-a[now+1].l+1<=i){
now++;
add(a[now].l,1);
add(a[now].r+1,-1);
}
}
return 0;
} |
#include<bits/stdc++.h>
#define N 300005
using namespace std;
int val[N];
int n,m;
void solve(int l,int r){
for(int i=1,ne,lastl=1e9;i<=r;i=ne+1){
if(i<=l) ne=min(l/(l/i),r/(r/i));
else ne=r;
if(l/i<lastl){
val[l/i+1]++,val[min(lastl,r/i)+1]--;
lastl=l/i;
}
}
}
int main(){
scanf("%d%d",&n,&m);
for(int i=1,l,r;i<=n;i++){
scanf("%d%d",&l,&r);
solve(l-1,r);
}
for(int i=1;i<=m;i++) printf("%d\n",val[i]+=val[i-1]);
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
const int maxn=3e5+10;
int n,m,Ans[maxn],vis[maxn];
long long O;
int main()
{
#ifdef h10
freopen("E.in","r",stdin);
freopen("E.out","w",stdout);
#endif
int i,j,l,r,x;
scanf("%d%d",&n,&m);
for (i=1;i<=n;i++)
{
scanf("%d%d",&l,&r);
if (!l) {Ans[1]++; continue;}
int lu=m+1;
for (x=1;x*x<=m;x++)
{
int u=(l+x-1)/x,v=r/x;
if (u<=v)
{
if (v<lu) Ans[u]++,Ans[v+1]--;
else Ans[u]++,Ans[lu]--;
lu=u;
for (j=u;j<=v&&j*j<=m;j++)
{
O++;
if (vis[j]!=i) vis[j]=i;
else break;
}
}
}
for (x=1;x*x<=m;x++)
{
int u=(l+x-1)/x,v=r/x;
if (u<=v&&vis[x]!=i)
vis[x]=i,Ans[x]++,Ans[x+1]--;
}
}
for (i=1;i<=m;i++)
Ans[i]+=Ans[i-1],printf("%d\n",Ans[i]);
}
|
#include "bits/stdc++.h"
using namespace std;
typedef long long LL;
const LL MOD = 1000000007LL;
int l[300000], r[300000];
vector<int> range[100001];
int bit[100001], n;
int sum(int i) {
int s = 0;
while (i > 0) {
s += bit[i];
i -= i&-i;
}
return s;
}
void add(int i, int x) {
while (i <= n) {
bit[i] += x;
i += i&-i;
}
}
int main() {
int N, M;
cin >> N >> M;
for (int i = 0; i < N; i++) {
cin >> l[i] >> r[i];
range[r[i] - l[i] + 1].push_back(i);
}
n = M;
int cnt = N;
for (int d = 1; d <= M; d++) {
cnt -= range[d].size();
for (int idx : range[d]) {
add(l[idx], 1);
if (r[idx] + 1 <= n) add(r[idx] + 1, -1);
}
int ans = cnt;
for (int i = d; i <= M; i += d) {
ans += sum(i);
}
cout << ans << endl;
}
} |
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int m,n,a[101000];
int main()
{
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++){
int L,R,l,r;
scanf("%d%d",&L,&R);L--;
for(l=1;l<=L;l=r+1){
r=min(L/(L/l),R/(R/l));
if(L/l!=R/l)a[l]++,a[r+1]--;
}
a[l]++;a[R+1]--;
}
for(int i=1;i<=m;i++){
a[i]+=a[i-1];
printf("%d\n",a[i]);
}
} |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,a) FOR(i,0,a)
typedef long long ll;
typedef pair<int,int> PA;
const int MAX_N=3e5,MAX_M=1e5;
int N,M;
PA item[MAX_N];
int bit[MAX_M+1];
void add(int i,int x){
while(i<=M){
bit[i]+=x;
i+=i&(-i);
}
}
int query(int i){
int res=0;
while(i){
res+=bit[i];
i-=i&(-i);
}
return res;
}
int main(){
scanf("%d %d",&N,&M);
REP(i,N){
int L,R;
scanf("%d %d",&L,&R);
item[i]=make_pair(L,R);
}
sort(item,item+N,[](const PA &a,const PA &b){
return a.second-a.first<b.second-b.first;
});
auto ite=item;
FOR(d,1,M+1){
while(ite!=item+N && ite->second-ite->first+1<d){
add(ite->first,1);
add(ite->second+1,-1);
ite++;
}
int ans=N-(ite-item);
for(int x=d;x<=M;x+=d){
ans+=query(x);
}
printf("%d\n",ans);
}
return 0;
}
|
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <queue>
#define rep(i,l,r) for(int i=(l);i<=(r);++i)
#define per(i,r,l) for(int i=(r);i>=(l);--i)
#define fo(i,l,r,x) for(int i=(l);i<=(r);i+=(x))
using namespace std;
const int maxn=4e5+10;
int n,m,b[maxn];
struct node{int l,r;}a[maxn];
inline bool operator <(node a,node b){return a.r-a.l<b.r-b.l;}
void add(int i,int x){for(;i<=m;i+=i&(-i)) b[i]+=x;}
int sum(int i){int ans=0;for(;i;i-=i&(-i)) ans+=b[i];return ans;}
int main(){
scanf("%d%d",&n,&m);
rep(i,1,n) scanf("%d%d",&a[i].l,&a[i].r);
sort(a+1,a+n+1);int i=1;
rep(d,1,m){
while(i<=n&&a[i].r-a[i].l+1==d) add(a[i].l,1),add(a[i].r+1,-1),++i;
int ans=n-i+1;
fo(j,d,m,d) ans+=sum(j);
printf("%d\n",ans);
}
return 0;
} |
#include <iostream>
using namespace std;
int ans[500005],cf[500005],l[500005],r[500005];
const int bl=530;
int main(int argc, char** argv) {
int n,m,t;
ios::sync_with_stdio(false);
cin >> n >> m;
t=m/bl;
for(int i=1;i<=n;i++)
cin >> l[i] >> r[i];
for(int i=1;i<=n;i++)
{
int lst=t;
for(int j=bl;j>=1;j--)
{
int L=(l[i]-1)/j+1,R=r[i]/j;
L=max(L,lst+1);
if(R<L) continue;
++cf[L],--cf[R+1];
lst=max(lst,R);
}
}
for(int i=1;i<=t;i++)
{
int ans=0;
for(int j=1;j<=n;j++)
ans+=(l[j]-1)/i!=r[j]/i;
cout << ans << "\n";
}
for(int i=t+1;i<=m;i++)
{
cf[i]+=cf[i-1];
cout << cf[i] << "\n";
}
return 0;
}
//dlstxdy |
#include<bits/stdc++.h>
#define N 300005
using namespace std;
vector<int> G[N];
int n,m,l[N],r[N],now,ans,tr[N];
void M(int x,int d){ while(x<=m) tr[x]+=d,x+=(x&(-x));}
int Q(int x){ int s=0; while(x) s+=tr[x],x-=(x&(-x)); return s;}
int main()
{
int i,j;
scanf("%d %d",&n,&m);
for(i=1;i<=n;i++){
scanf("%d %d",&l[i],&r[i]);
G[r[i]-l[i]+1].push_back(l[i]);
}
now=n;
for(i=1;i<=m;i++){
now-=G[i-1].size(),ans=now;
for(j=0;j<G[i-1].size();j++)
M(G[i-1][j],1),M(G[i-1][j]+i-1,-1);
for(j=i;j<=m;j+=i) ans+=Q(j);
printf("%d\n",ans);
}
return 0;
}
|
#include <bits/stdc++.h>
std::vector<int> A[' '];
int N, M, S[' '], B, L, R, I;
void U(int z, int u) {
while (z <= N)
S[z] += u, z += z & -z;
}
int main() {
~scanf("%d%d", &M, &N);
for (; ~scanf("%d%d", &L, &R);)
A[R - L + 1]
.push_back(L);
for (L = 1; L <= N; L++) {
B = M;
for (I = L; I <= N; I += L) {
R = I;
while (R)
B += S[R], R -= R & -R;
}
for (int u : A[L])
U(u, 1), U(u + L, -1), M--;
printf("%d\n", B);
}
} |
#include<bits/stdc++.h>
using namespace std;
const int N=1e6+10;
int gi() {
int x=0,o=1;char ch=getchar();
while(!isdigit(ch)&&ch!='-') ch=getchar();
if(ch=='-') o=-1,ch=getchar();
while(isdigit(ch)) x=x*10+ch-'0',ch=getchar();
return x*o;
}
struct dat {
int l,r;
bool operator<(const dat &A) const {
return r-l<A.r-A.l;
}
} p[N];
int n,m,c[N],cnt[N];
void modify(int p,int v) {
++p;
while(p<=m+1) c[p]+=v,p+=p&-p;
}
int query(int p) {
int ret=0;++p;
while(p) ret+=c[p],p-=p&-p;
return ret;
}
int main() {
cin>>n>>m;
for(int i=1;i<=n;i++) p[i]={gi(),gi()},++cnt[p[i].r-p[i].l+1];
sort(p+1,p+n+1);
for(int i=m;i;i--) cnt[i]+=cnt[i+1];
for(int i=1,j=1;i<=m;i++) {
while(j<=n&&p[j].r-p[j].l+1<i) modify(p[j].l,1),modify(p[j].r+1,-1),++j;
int sum=0;
for(int k=0;k<=m;k+=i) sum+=query(k);
cout<<sum+cnt[i]<<'\n';
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1234567;
int n, m;
pair<int, int> pr[N];
int fen[N];
void fadd(int i, int foo) {
while (i < N) {
fen[i] += foo;
i += i & -i;
}
}
int fget(int i) {
int ret = 0;
while (i > 0) {
ret += fen[i];
i -= i & -i;
}
return ret;
}
int main() {
scanf("%d %d", &n, &m);
for (int i = 0; i < n; i++) {
int l, r; scanf("%d %d", &l, &r);
pr[i] = make_pair(l, r);
}
sort(pr, pr + n, [&](const pair<int, int> a, const pair<int, int> b) {
return a.second - a.first < b.second - b.first;
});
for (int d = 1, j = 0; d <= m; d++) {
while (j < n && pr[j].second - pr[j].first + 1 < d) {
fadd(pr[j].first, 1);
fadd(pr[j].second + 1, -1);
j++;
}
int ans = n - j;
for (int i = 0; (long long) i * d <= m; i++) {
ans += fget(i * d);
}
printf("%d\n", ans);
}
return 0;
} |
#include <bits/stdc++.h>
const int MAXN = 100010;
int n, M, ansl[MAXN];
int main() {
std::ios_base::sync_with_stdio(false), std::cin.tie(0);
std::cin >> n >> M;
for (int i = 1, L, R; i <= n; ++i) {
std::cin >> L >> R; --L;
int t1, t2, l = 1, r;
for (; l <= L; l = r + 1) {
t1 = L / l, t2 = R / l;
r = std::min(L / t1, R / t2);
if (t2 > t1) ++ansl[l], --ansl[r + 1];
}
++ansl[L + 1], --ansl[R + 1];
}
for (int i = 1; i <= M; ++i)
std::cout << (ansl[i] += ansl[i - 1]) << '\n';
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;vector<int>A[' '];int N,M,S[' '],B,L,R,I,X;void U(int z,int u){while(z<=N)S[z]+=u,z+=z&-z;}int main(){cin>>M>>N;for(I=1;I<=M;I++)cin>>L>>R,A[R-L+1].push_back(L);for(L=1;L<=N;L++){B=M;for(I=L;I<=N;I+=L){R=0,X=I;while(X)R+=S[X],X-=X&-X;B+=R;}for(int u:A[L])U(u,1),U(u+L,-1),M--;cout<<B<<endl;}} |
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<vector>
using namespace std;
const int MX=100111;
int n,m;
vector<int>q[MX];
vector<int>r[MX];
int ans[MX];
int c[MX];
#define lbt(x) ((x)&(-(x)))
inline void add(int x,int v){for(int i=x;i<=m;i+=lbt(i))c[i]+=v;}
inline int que(int x){int r=0;for(int i=x;i;i^=lbt(i))r+=c[i];return r;}
int main(){
scanf("%d%d",&n,&m);
for(int i=2;i<=m;i++)
for(int j=0;j<m;j+=i)
q[j+1].push_back(j+i-1);
for(int i=1;i<=m;i++)ans[i]=n;
for(int i=1;i<=n;i++){
static int L,R;
scanf("%d%d",&L,&R);
r[L].push_back(R);
}
for(int i=m;i;i--){
for(vector<int>::iterator it=r[i].begin();it!=r[i].end();it++)
add(*it,1);
for(vector<int>::iterator it=q[i].begin();it!=q[i].end();it++)
ans[(*it)-i+2]-=que(min(m,*it));
}
for(int i=1;i<=m;i++)
printf("%d\n",ans[i]);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int N, M;
vector<int> l, r;
int main()
{
cin >> N >> M;
l.resize(N);
r.resize(N);
for (int i=0; i<N; i++) cin >> l[i] >> r[i];
vector<int> ans(M+1, 0);
for (int i=0; i<N; i++)
{
int l_ = l[i], r_ = r[i];
int l__ = r_ + 1;
for (int j=1; j * j<=M; j++)
{
if ((l_ + j - 1) / j <= r_ / j)
{
ans[(l_ + j - 1)/ j]++;
ans[min(r_ / j + 1, l__)]--;
l__ = (l_+j-1)/j;
}
}
for (int m=1; m<l__; m++)
{
if ((l_ - 1) / m < r_ / m)
{
ans[m]++; ans[m+1]--;
}
}
}
int ans_ = 0;
for (int i=1; i<=M; i++)
{
ans_ += ans[i];
cout << ans_ << endl;
}
}
|
#include <iostream>
#include <vector>
using namespace std;
class BIT{
vector<int> bit;
public:
BIT(int siz) : bit(siz + 1,0){}
void add(int i,int x){
while(i < bit.size()){
bit[i] += x;
i += i & -i;
}
}
int sum(int i){
int s = 0;
while(i){
s += bit[i];
i -= i & -i;
}
return s;
}
};
int main(){
int n,m;
vector<int> vec[100001];
cin >> n >> m;
BIT bit(m);
for(int i = 0;i < n;i++){
int l,r;
cin >> l >> r;
vec[r - l].push_back(l);
}
int ans = n;
for(int i = 0;i < m;i++){
int add = 0;
for(int j = i + 1;j <= m;j += i + 1) add += bit.sum(j);
cout << ans + add << endl;
for(int l : vec[i]){
ans--;
bit.add(l,1);
bit.add(l + i + 1,-1);
}
}
return 0;
} |
#include<stdio.h>
#include<algorithm>
using namespace std;
int tree[400005],S[100005];
int up(int x, int y)
{
return (x-1)/y+1;
}
int down(int x, int y)
{
return x/y;
}
int main()
{
int n,m,l,r,i,j,R,Ri,Li;
scanf("%d %d", &n, &m);
for(i=1;i<=n;i++){
scanf("%d %d", &l, &r);
R=0;
while(R*R<=l)R++;
R--;
Ri=m;
for(j=1;j<=R;j++){
Ri=min(Ri,r/j);
Li=up(l,j);
S[Ri+1]--;
S[Li]++;
Ri=Li-1;
}
for(j=1;j<=Ri;j++){
if(r/j>(l-1)/j)S[j]++,S[j+1]--;
}
}
for(i=1;i<=m;i++){
S[i]+=S[i-1];
printf("%d\n", S[i]);
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
template<typename T>inline void read(T& t)
{T f=1;char ch=getchar();t=0;
while(ch<'0'||ch>'9'){if(ch=='-')f=-f;ch=getchar();}
while(ch>='0'&&ch<='9')t=t*10+ch-'0',ch=getchar();t*=f;}
template <typename T,typename... Args>
inline void read(T& t, Args&... args)
{read(t);read(args...);}
int n,m,L,R;
int sum[100005];
int main()
{
read(n,m);
// printf("-- %d %d --",n,m);
for(int i=1;i<=n;i++)
{
read(L,R);
L--;
// printf("ok\n");
for(int l=1,r;l<=L;l=r+1)
{
r=min(L/(L/l),R/(R/l));
// printf("--- %d %d ---\n",l,r);
if(L/l<R/l)
{
sum[l]++;
sum[r+1]--;
}
}
sum[L+1]++;
sum[R+1]--;
}
for(int i=1;i<=m;i++)printf("%d\n",sum[i]+=sum[i-1]);
} |
#include<bits/stdc++.h>
const int N=3e5+10;
using namespace std;
int n,m,c[N],ans;
struct Interval{
int l,r;
bool operator < (const Interval &x)const{return l>x.l;}
}a[N];
vector<int>G[N];
inline int lowbit(int x){return x&(-x);}
inline void add(int x,int val){for(int i=x;i<=m;i+=lowbit(i))c[i]+=val;}
inline int ask(int x){
int ans=0;
for(int i=x;i;i-=lowbit(i))ans+=c[i];
return ans;
}
inline int read(){
int f=1,x=0;char ch;
do{ch=getchar();if(ch=='-')f=-1;}while(ch<'0'||ch>'9');
do{x=x*10+ch-'0';ch=getchar();}while(ch>='0'&&ch<='9');
return f*x;
}
int main(){
n=read();m=read();
for(int i=1;i<=n;i++)a[i].l=read(),a[i].r=read(),G[a[i].r-a[i].l+1].push_back(a[i].l);
int cur=n;
for(int i=1;i<=m;i++){
cur-=G[i-1].size();ans=cur;
for(int j=0;j<G[i-1].size();j++)add(G[i-1][j],1),add(G[i-1][j]+i-1,-1);
for(int j=i;j<=m;j+=i)ans+=ask(j);
printf("%d\n",ans);
}
} |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
struct aaa{
int x,y;
}a[500010];
int n,m,ans,f[500010];
bool cmp(aaa a,aaa b){
return a.y-a.x<b.y-b.x;
}
int lowbit(int x){
return x&(-x);
}
void ins(int x,int w){
int i;
for(i=x;i<=m;i+=lowbit(i))f[i]+=w;
}
int query(int x){
int i,xlh=0;
for(i=x;i;i-=lowbit(i))xlh+=f[i];
return xlh;
}
int main(){
int i,j=0,k;
scanf("%d%d",&n,&m);
for(i=1;i<=n;i++)scanf("%d%d",&a[i].x,&a[i].y);
sort(a+1,a+n+1,cmp);
for(i=1;i<=m;i++){
while(j<n&&a[j+1].y-a[j+1].x<i){
j++;
ins(a[j].x,1);ins(a[j].y+1,-1);
}
ans=0;
for(k=i;k<=m;k+=i)ans+=query(k);
printf("%d\n",ans+n-j);
}
} |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
template<class G>
class Fenwick_tree_dual{
vector<G> a;
public:
Fenwick_tree_dual(int n):a(n){}
void add(int l,int r,G val){
if(l==0){
for(;r>0;r-=r&-r) a[r-1]+=val;
return;
}
add(0,r,val);
add(0,l,-val);
}
G sum(int i){
G res{};
for(i++;i<=a.size();i+=i&-i) res+=a[i-1];
return res;
}
};
struct interval{
int l,r;
bool operator<(const interval& I)const{ return r-l<I.r-I.l; }
};
int main(){
int n,m; scanf("%d%d",&n,&m);
vector<interval> I(n);
rep(i,n) scanf("%d%d",&I[i].l,&I[i].r), I[i].r++;
sort(I.begin(),I.end());
int idx=0;
Fenwick_tree_dual<int> F(m+1);
for(int d=1;d<=m;d++){
while(idx<n && I[idx].r-I[idx].l<=d){
F.add(I[idx].l,I[idx].r,1);
idx++;
}
int ans=n-idx;
for(int x=d;x<=m;x+=d) ans+=F.sum(x);
printf("%d\n",ans);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
//MACROS
#define pb push_back
#define rep(i, begin, end) for (__typeof(end) i = (begin) - ((begin) > (end)); i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))
typedef long long LL;
typedef pair <int,int> PII;
int t[1<<20], n, m, cur;
vector <PII> v[1<<20];
void update(int idx, int val) { for (;idx <= m; idx += (idx & -idx)) t[idx] += val; }
int get(int idx) {
int res = 0;
for (;idx; idx -= (idx & -idx)) res += t[idx];
return res;
}
int main() {
cin >> n >> m;
rep(i,0,n) {
int x, y;
cin >> x >> y;
v[y-x+1].pb({x,y});
}
rep(i,1,m+1) {
cur += v[i].size();
for (auto p : v[i]) update(p.first,1), update(p.second+1,-1);
int ans = n - cur;
for (int j = i; j <= m; j += i) ans += get(j);
cout << ans << "\n";
}
}
|
#include<bits/stdc++.h>
typedef long long ll;
ll gi(){
ll x=0,f=1;
char ch=getchar();
while(!isdigit(ch))f^=ch=='-',ch=getchar();
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
struct intv{int l,r;}s[300010];
int ans[100010],t[100010],n,m;
void update(int x,int d){while(x<=m)t[x]+=d,x+=x&-x;}
int query(int x){int r=0;while(x)r+=t[x],x-=x&-x;return r;}
int main(){
#ifdef XZZSB
freopen("in.in","r",stdin);
freopen("out.out","w",stdout);
#endif
n=gi(),m=gi();
for(int i=1;i<=n;++i)s[i].l=gi(),s[i].r=gi();
std::sort(s+1,s+n+1,[](intv a,intv b){return a.r-a.l<b.r-b.l;});
for(int i=1,p=1;i<=m;++i){
while(p<=n&&s[p].r-s[p].l+1==i)update(s[p].l,1),update(s[p].r+1,-1),++p;
int res=n-p+1;
for(int j=i;j<=m;j+=i)res+=query(j);
printf("%d\n",res);
}
return 0;
}
|
#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<iostream>
#include<cstring>
#include<string>
#include<algorithm>
using namespace std;
struct qq{int l,r;}a[300005];
int m,n,now,b[100005];
bool cmp(qq e,qq f)
{
return e.r-e.l<f.r-f.l;
}
void add(int x,int d)
{
for (int k=x;k<=n;k+=k&-k)
b[k]+=d;
}
int sum(int x)
{
int s=0;
for (int k=x;k;k-=k&-k)
s+=b[k];
return s;
}
int main()
{
scanf("%d%d",&m,&n);
for (int i=1;i<=m;i++)
scanf("%d%d",&a[i].l,&a[i].r);
sort(a+1,a+1+m,cmp);
now=1;
for (int i=1;i<=n;i++)
{
int ans=0;
for (int j=now;j<=m;j++)
if (a[j].r-a[j].l<i)
{
add(a[j].l,1);
add(a[j].r+1,-1);
now++;
}
else
break;
for (int j=i;j<=n;j+=i)
ans+=sum(j);
printf("%d\n",(m-now+1)+ans);
}
} |
#include <iostream>
#include <cstdio>
#include <algorithm>
#define N 300002
using namespace std;
struct shop{
int l,r;
}a[N];
int n,m,i,j=1,d,c[N];
int read()
{
char c=getchar();
int w=0;
while(c<'0'||c>'9') c=getchar();
while(c<='9'&&c>='0'){
w=w*10+c-'0';
c=getchar();
}
return w;
}
int my_comp(const shop &x,const shop &y)
{
return x.r-x.l<y.r-y.l;
}
int lowbit(int x)
{
return x&(-x);
}
int ask(int x)
{
int ans=0;
for(int i=x;i>=1;i-=lowbit(i)) ans+=c[i];
return ans;
}
void add(int x,int y)
{
for(int i=x;i<=m+1;i+=lowbit(i)) c[i]+=y;
}
int main()
{
n=read();m=read();
for(i=1;i<=n;i++) a[i].l=read()+1,a[i].r=read()+1;
sort(a+1,a+n+1,my_comp);
for(d=1;d<=m;d++){
while(j<=n&&a[j].r-a[j].l<d){
add(a[j].l,1);
add(a[j].r+1,-1);
j++;
}
int ans=n-j+1;
for(i=1;i<=m+1;i+=d) ans+=ask(i);
printf("%d\n",ans);
}
} |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 200100;
int fen[maxn], ans[maxn], qtd[maxn];
vector<int> divs[maxn], bck[maxn];
void add(int x, int v){
for(; x < maxn; x += x & - x) fen[x] += v;
}
int sum(int x){
int ans = 0;
for(; x; x -= x & - x) ans += fen[x];
return ans;
}
int main(){
int n, m; cin >> n >> m;
for(int i = 1; i <= m; i++) for(int j = i; j <= m; j += i) divs[j].push_back(i);
for(int i = 1; i <= n; i++){
int l, r; cin >> l >> r;
qtd[r]++;
bck[l].push_back(r);
}
for(int i = m; i >= 1; i--){
add(i, qtd[i]);
for(int q: divs[i]) ans[q] += sum(i + q - 1);
for(int q: bck[i]) add(q, -1);
}
for(int i = 1; i <= m; i++) cout << ans[i] << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
const int N = 3e5 + 5;
int n, m, l[N], r[N], fen[N];
vector<int> queRy[N];
void update(int id, int val){
for(int i = id; i <= m; i += (i & -i)){
fen[i] += val;
}
}
int get(int id){
int sum = 0;
for(int i = id; i >= 1; i -= (i & -i)){
sum += fen[i];
}
return sum;
}
int main(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cin >> n >> m;
for(int i = 1; i <= n; i++){
cin >> l[i] >> r[i];
queRy[r[i] - l[i] + 1].push_back(i);
}
int res = n;
for(int i = 1; i <= m; i++){
int tmp = 0;
for(int j = i; j <= m; j += i){
tmp += get(j);
}
cout << res + tmp << "\n";
for(int j: queRy[i]){
update(l[j], 1);
update(r[j] + 1, -1);
res--;
}
}
} |
#pragma GCC target("avx")
#pragma GCC optimize(3)
#pragma GCC optimize("Ofast")
#pragma GCC optimize("inline")
#pragma GCC optimize("-fgcse")
#pragma GCC optimize("-fgcse-lm")
#include<bits/stdc++.h>
#define rep(i,x,y) for (int i=(x);i<=(y);i++)
#define ll long long
#define inf 1000000001
using namespace std;
int read(){
char ch=getchar();int x=0,op=1;
for (;!isdigit(ch);ch=getchar()) if (ch=='-') op=-1;
for (;isdigit(ch);ch=getchar()) x=(x<<1)+(x<<3)+ch-'0';
return x*op;
}
void write(ll a){
if (a<0) putchar('-'),a=-a;
if (a>=10) write(a/10);putchar(a%10+'0');
}
#define N 100005
int n,m;ll ans[N];
int main(){
n=read(),m=read();
rep (i,1,n){
int l=read()-1,r=read(),last,j;
for (j=1;j<=l;j=last+1){
last=min(l/(l/j),r/(r/j));//cerr<<last<<' ';
if (r/j-l/j>0) ans[j]++,ans[last+1]--;
}
if (j<=r) ans[j]++,ans[r+1]--;
}
rep (i,1,m) ans[i]+=ans[i-1],write(ans[i]),puts("");
return 0;
} |
#include<bits/stdc++.h>
#define rep(i,n)for(int i=0;i<(n);i++)
using namespace std;
typedef pair<int, int>P;
int n, m;
int bit[100001];
void add(int k, int x) {
while (k <= m) {
bit[k] += x;
k += k &-k;
}
}
int sum(int k) {
int res = 0;
while (k > 0) {
res += bit[k];
k -= k&-k;
}
return res;
}
int main() {
scanf("%d%d", &n, &m);
vector<P>v;
rep(i, n) {
int l, r; scanf("%d%d", &l, &r);
v.push_back(P(r - l + 1, l));
}
sort(v.begin(), v.end());
int s = 0;
for (int i = 1; i <= m; i++) {
while (s < v.size() && v[s].first < i) {
add(v[s].second, 1); add(v[s].second + v[s].first, -1);
s++;
}
int ans = n - s;
for (int j = 0; j <= m; j += i)ans += sum(j);
printf("%d\n", ans);
}
} |
#include <bits/stdc++.h>
using namespace std;
const int N = 3e5 + 5;
int n, m;
vector <int> seg[N];
int it[N], ans[N];
vector<pair<int, int>> line[N];
void upd(int i, int val) {
for(; i <= 3e5; i += i & -i) it[i] += val;
}
int get(int i) {
int ans = 0;
for(; i; i -= i & -i) ans += it[i];
return ans;
}
int main() {
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
cin >> n >> m;
for(int i = 1; i <= n; ++i) {
int Left, Right;
cin >> Left >> Right;
seg[Left].push_back(Right);
}
for(int i = 1; i <= m; ++i) ans[i] = n;
for(int i = 1; i <= m; ++i) {
for(int j = 0; j <= m; j += i) {
line[j + 1].push_back(make_pair(min(m, i + j - 1), i));
}
}
for(int i = m; i >= 1; --i) {
for(auto &v : seg[i]) upd(v, 1);
for(auto &v : line[i]) ans[v.second] -= get(v.first);
}
for(int i = 1; i <= m; ++i) cout << ans[i] << '\n';
} |
#include<cstdio>
#include<cmath>
#include<algorithm>
using namespace std;
int sum[100010];
int main()
{
int n, m;
scanf("%d %d", &n, &m);
for (int i = 1; i <= n; i++) {
int q, w;
scanf("%d %d", &q, &w);
sum[q]++;
sum[w+1]--;
int pre = q;
for (int y = 2; y <= sqrt(w); y++) {
int st = q / y;
if (q%y)
st++;
int en = w / y;
sum[st]++;
sum[min(en + 1, pre)]--;
pre = st;
}
int x = sqrt(w);
for (int y = 1; y <= min(x,pre-1); y++) {
int st = q / y;
if (q%y)
st++;
st *= y;
if (q <= st && st <= w) {
sum[y]++;
sum[y + 1]--;
}
}
}
int dap = 0;
for (int i = 1; i <= m; i++) {
dap += sum[i];
printf("%d\n",dap);
}
} |
#include <iostream>
#include <cstdio>
#include <map>
#include <set>
#include <queue>
#include <vector>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#define rep(i,a,b) for(int i = a; i <= b; i++)
#define dep(i,a,b) for(int i = a; i >= b; i--)
#define Rep(i,a) for(int i = 0; i < a; i++)
#define pb(a) push_back(a)
#define mp(a,b) make_pair(a,b)
#define ab(x) ((x) < 0 ? -(x) : (x))
using namespace std;
typedef long long LL;
typedef map<int, int>::iterator mit;
typedef set<int>::iterator sit;
const int N = 300010;
int ans[N];
int main() {
int n, m; scanf("%d%d",&n,&m);
rep(i,1,n) {
ans[1]++;
int a, b; scanf("%d%d",&a,&b); a--;
for(int l = 1, r; l <= a && l <= b; l = r + 1) {
r = min(a / (a / l), b / (b / l));
if (a / l == b / l) ans[l]--, ans[r + 1]++;
}
ans[b + 1]--;
}
rep(i,1,m) ans[i] += ans[i - 1];
rep(i,1,m) printf("%d\n",ans[i]);
} |
#include <bits/stdc++.h>
std::vector<int> A[' '];
int n, m, S[' '], a, l, r, i, d;
void U(int x, int u) {
while (x <= n)
S[x] += u, x += x & -x;
}
int Q(int x) {
r = 0;
while (x)
r += S[x], x -= x & -x;
return r;
}
int main() {
scanf("%d%d", &m, &n);
for (i = 1; i <= m; i++)
scanf("%d%d", &l, &r), A[r - l + 1].push_back(l);
for (d = 1; d <= n; d++) {
a = m;
for (i = d; i <= n; i += d)
a += Q(i);
for (int u : A[d])
U(u, 1), U(u + d, -1), m--;
printf("%d\n", a);
}
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
const int nn=3e5,mm=1e5+1;
int n,m,dep,c[mm];
struct sou{int l,r,di;}ran[nn];
bool cmp(sou a,sou b){return a.di<b.di;}
int lowbit(int p){return p&(-p);}
int prefix(int i){
int p=0;
for(;i;i-=lowbit(i))p+=c[i];
return p;
}void add(int i,int v){for(;i<=m;i+=lowbit(i))c[i]+=v;}
int main(){
scanf("%d%d",&n,&m);
for(int i=0;i<n;i++){
scanf("%d%d",&ran[i].l,&ran[i].r);
ran[i].di=ran[i].r-ran[i].l;
}sort(ran,ran+n,cmp);
for(int i=1,ans;i<=m;i++){
for(;dep<n&&ran[dep].di<i;dep++)add(ran[dep].l,1),add(ran[dep].r+1,-1);
ans=n-dep;
for(int j=i;j<=m;j+=i)ans+=prefix(j);
printf("%d\n",ans);
}return 0;
} |
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <bitset>
using namespace std;
typedef long long ll;
typedef pair<int,ll> P;
typedef pair<P,P> P2;
const ll INF=100000000000000001;
int l[300001]={};
int r[300001]={};
int x[100001]={};
int n,m;
int addx(int k){
int s=l[k];
while(s<=m){
x[s]++;
s+=s&-s;
}
s=r[k]+1;
while(s<=m){
x[s]--;
s+=s&-s;
}
return 0;
}
int sumx(int s){
int r=0;
while(s>0){
r+=x[s];
s-=s&-s;
}
return r;
}
int main() {
cin>>n>>m;
vector<int> v[100001];
for(int i=1;i<n+1;++i){
cin>>l[i]>>r[i];
v[r[i]-l[i]+1].push_back(i);
}
int ln=n;
for(int i=1;i<m+1;++i){
ln-=v[i-1].size();
int t=ln;
for(auto it:v[i-1])addx(it);
for(int j=1;(i*j)<=m;++j)t+=sumx(i*j);
cout<<t<<endl;
}
return 0;
}
|
#include <bits/stdc++.h>
#define lowbit(x) (x & -x)
using namespace std;
const int _ = 3e5 + 10;
int N, M, d;
struct node {
int l, r, len;
} a[_];
struct BIT {
int c[_];
void insert(int x, int y) {
for ( ; x <= M + 1; x += lowbit(x)) c[x] += y;
}
int query(int x) {
int y = 0;
for ( ; x; x -= lowbit(x)) y += c[x];
return y;
}
} tr;
int main() {
scanf("%d%d", &N, &M);
for (int i = 1; i <= N; ++i) {
scanf("%d%d", &a[i].l, &a[i].r);
a[i].len = (a[i].r - a[i].l + 1);
}
sort(a + 1, a + N + 1,
[](node a, node b) -> bool { return a.len < b.len; });
for (int d = 1, p = 1; d <= M; ++d) {
while (p <= N && a[p].len <= d) {
tr.insert(a[p].l, 1);
tr.insert(a[p].r + 1, -1);
++p;
}
int ans = N - p + 1;
for (int i = d; i <= M; i += d)
ans += tr.query(i);
printf("%d\n", ans);
}
return 0;
} |
#include<bits/stdc++.h>
#define P push_back
#define L(x) ((x)&-(x))
using namespace std;
const int N=100005;
vector<int>e[N];
int n,m,s[N],a;
void U(int x,int u){while(x<=n)s[x]+=u,x+=L(x);}
int Q(int x){int r=0;while(x)r+=s[x],x-=L(x);return r;}
int main(){
scanf("%d%d",&m,&n);
for(int i=1,l,r;i<=m;i++)scanf("%d%d",&l,&r),e[r-l+1].P(l);
for(int d=1;d<=n;d++){a=m;for(int i=d;i<=n;i+=d)a+=Q(i);for(int u:e[d])U(u,1),U(u+d,-1),m--;printf("%d\n",a);}
return 0;
} |
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
#define N 300030
inline int read(){
int x=0,f=1;
char c=getchar();
while(c<'0'||c>'9'){
if(c=='-')f=-1;
c=getchar();
}
while(c>='0'&&c<='9'){
x=(x<<3)+(x<<1)+c-'0';
c=getchar();
}
return x*f;
}
int n,m,s[N];
int main(){
n=read(),m=read();
for(int i=1;i<=n;++i){
int L=read()-1,R=read();
int r=1;
for(int l=1;l<=L;l=r+1){
r=min(L/(L/l),R/(R/l));
if(L/l<R/l){
++s[l],--s[r+1];
}
}
s[L+1]++,s[R+1]--;
}
for(int i=1;i<=m;++i){
s[i]+=s[i-1];
printf("%d\n",s[i]);
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
const int _=1e5+7;
const int __=3e5+7;
struct com{
int l,r,len;
}c[__];
int n,m,tr[_],ans;
bool rule(com a,com b){ return a.len<b.len; }
void add(int x,int w){
for(int i=x;i<=m;i+=i&(-i))
tr[i]+=w;
}
void modify(int l,int r,int w){
add(l,w);
add(r+1,-w);
}
int query(int x){
int res=0;
for(int i=x;i;i-=i&(-i))
res+=tr[i];
return res;
}
int main(){
//#ifndef ONLINE_JUDGE
//freopen("x.in","r",stdin);
//#endif
cin>>n>>m;
for(int i=1;i<=n;i++){
scanf("%d%d",&c[i].l,&c[i].r);
c[i].len=c[i].r-c[i].l+1;
}
sort(c+1,c+1+n,rule);
int p=1;
for(int i=1;i<=m;i++){
while(p<=n&&c[p].len<i){
modify(c[p].l,c[p].r,1);
p++;
}
//printf("p: %d\n",p);
ans=n-p+1;
for(int j=i;j<=m;j+=i)
ans+=query(j);
printf("%d\n",ans);
}
return 0;
}
|
#include <bits/stdc++.h>
#define s second
using T=std::pair<int,int>;
T*P=new T[1<<19],*p;
int BIT[1<<17],j,k,l,r,x,M;
int main(){
p=P;
while(~scanf("%d%d",&p->first,&p->s)) p++;
M=P->s;
++P;
sort(P,p,[](T a,T b){return a.s-a.first<b.s-b.first;});
--p;
//for(int d=0;d<p;d++)printf("%d ",P[i].first);puts("");
while(x++<M){
while(std::tie(l,r)=*P, l&&r-l<x){
for(j=l; j<=M; j+=j&-j) BIT[j]++;
for(j=r+1; j<=M; j+=j&-j) BIT[j]--;
P++;
}
k=p-P;
for(j=0; j<=M; j+=x) {
for(l=j; l; l-=l&-l)
k+=BIT[l];
}
printf("%d\n",k+1);
}
j=0;
} |
#include<bits/stdc++.h>
using namespace std;
const int N=3e5+10,M=1e5+10,oo=1e9;
int n,m,tree[M];
struct Node{
int l,r,len;
bool operator<(Node k)const{return len<k.len;}
}p[N];
void upd(int x,int d){
while(x<=m){
tree[x]+=d;
x+=x&(-x);
}
return;
}
int que(int x){
int temp=0;
while(x>0){
temp+=tree[x];
x-=x&(-x);
}
return temp;
}
int main(){
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++) scanf("%d%d",&p[i].l,&p[i].r),p[i].len=p[i].r-p[i].l+1;
sort(p+1,p+n+1);
p[n+1].len=oo;
int point=1,temp=0;
for(int i=1;i<=m;i++){
while(p[point].len<i){
upd(p[point].l,1);
upd(p[point].r+1,-1);
point++;
}
temp=0;
for(int j=i;j<=m;j+=i) temp+=que(j);
printf("%d\n",temp+n-point+1);
}
return 0;
} |
#include<cstdio>
#include<algorithm>
using namespace std;
const int N=1e5+5;
int n,m,i,nxt,a[N];
int read(){
char c=getchar();int k=0;for (;c<48||c>57;c=getchar());
for (;c>47&&c<58;c=getchar()) k=(k<<3)+(k<<1)+c-48;return k;
}
void write(int x){if (x>9) write(x/10);putchar(x%10+48);}
int main(){
for (m=read(),n=read();m--;){
int l=read()-1,r=read();
for (i=1;i<=l;i=nxt+1){
nxt=min(l/(l/i),r/(r/i));
if (l/i!=r/i) a[i]++,a[nxt+1]--;
}
a[l+1]++;a[r+1]--;
}
for (i=1;i<=n;i++) write(a[i]+=a[i-1]),putchar('\n');
} |
#include<bits/stdc++.h>
#define N 300005
using namespace std;
int val[N];
int n,m;
void solve(int l,int r){
val[1]++;val[r-l+1]--;
for(int i=1,ne,lastl=1e9;i<=r;i=ne+1){
if(i<=l) ne=min(l/(l/i),r/(r/i));
else ne=r;
if(l/i<lastl){
if(l/i>=r-l){
val[l/i+1]++,val[min(lastl,r/i)+1]--;
}else{
val[r-l+1]++,val[min(lastl,r/i)+1]--;
return;
}
lastl=l/i;
}
}
}
int main(){
scanf("%d%d",&n,&m);
for(int i=1,l,r;i<=n;i++){
scanf("%d%d",&l,&r);
solve(l-1,r);
}
for(int i=1;i<=m;i++) printf("%d\n",val[i]+=val[i-1]);
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
typedef pair<int,int> pii;
#define F first
#define S second
const int N = 1e5 + 87;
int fen[N];
vector<pii> a[N];
int po[N];
int qry(int i)
{
int ret = 0;
for (; i; i ^= i & -i)
ret += fen[i];
return ret;
}
void upd(int i,int x)
{
for (; i < N; i += i & -i)
fen[i] += x;
}
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
int n,m;
cin >> n >> m;
for (int i = 0; i <n; ++i) {
int l,r;
cin >> l >> r;
a[r - l + 1].emplace_back(l,r);
}
for (int i = m; i >= 1; --i)
po[i] = a[i].size() + po[i+1];
for (int i = 1; i <= m; ++i) {
int ans = po[i];
for (int j = i; j <= m; j += i)
ans += qry(j);
cout << ans << '\n';
for (const pii & p : a[i]) {
upd(p.F,1);
upd(p.S+1,-1);
}
}
}
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define f(i, x, n) for(int i = x; i < (int)n; ++i)
int f[100001], n, m;
pair<int, pair<int, int> > p[300000];
inline void ad(int i, int x) { while (i <= m)f[i] += x, i += i & -i; }
inline int gt(int i) { int an = 0; while (i)an += f[i], i ^= i & -i; return an; }
int main(){
scanf("%d%d", &n, &m);
f(i, 0, n){
int a, b;
scanf("%d%d", &a, &b);
p[i] = make_pair(b - a + 1, make_pair(a, b));
}
sort(p, p + n);
int j = 0;
f(i, 1, m + 1){
while (j < n && p[j].first < i){
ad(p[j].second.first, 1);
ad(p[j].second.second + 1, -1);
++j;
}
int an = n - j;
for (int j = i; j <= m; j += i)an += gt(j);
printf("%d\n", an);
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 300010, M = 100010;
#define lowbit(x) ((x) & (-(x)))
int v[M],n,m,s,ans,p=1;
struct data {
int l,r;
bool operator < (const data& x) const {
return r - l < x.r - x.l;
}
} dat[N];
void add(int p,int val) {
for (; p <= s ; p += lowbit(p))
v[p] += val;
}
int query(int p) {
int res = 0;
for (; p ; p -= lowbit(p))
res += v[p];
return res;
}
int main() {
scanf("%d%d",&n,&m);
for (int i = 1 ; i <= n ; ++ i)
scanf("%d%d",&dat[i].l,&dat[i].r);
sort(dat+1,dat+n+1);
s = m+1;
for (int i = 1 ; i <= m ; ++ i) {
while (dat[p].r - dat[p].l + 1 < i && p <= n) {
add(dat[p].l+1,1);
add(dat[p].r+2,-1);
p ++;
}
ans = n - p + 1;
for (int j = 0 ; j <= m ; j += i)
ans += query(j+1);
printf("%d\n",ans);
}
return 0;
}
|
#include <cstdio>
#include <vector>
using namespace std;
int N, M, v[1100000], seen;
vector<int> range[100005];
void u(int n, int b, int t, int s, int e) {
if (s >= t || e <= b) return;
if (s <= b && e >= t) v[n] += 1;
else u(2*n,b,(b+t)/2,s,e), u(2*n+1,(b+t)/2,t,s,e);
}
int q(int n, int b, int t, int x) {
if (x < b || x >= t) return 0;
return v[n] + (t-b>1 ? q(2*n,b,(b+t)/2,x) + q(2*n+1,(b+t)/2,t,x):0);
}
int main() {
scanf("%d %d", &N, &M);
for (int i = 0, l, r; i < N; i++) {
scanf("%d %d", &l, &r);
range[r-l+1].push_back(l);
}
for (int i = 1; i <= M; i++) {
int o = N-seen;
for (int j = i; o < N && j <= M; j += i) o += q(1,1,M+5,j);
printf("%d\n", o);
seen += range[i].size();
for (auto it = range[i].begin(); it != range[i].end(); it++) u(1,1,M+5,*it,(*it)+i);
}
}
|
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#define N 300010
using namespace std;
struct node{
int l,r;
bool operator <(const node a)const{return r-l<a.r-a.l;}
}p[N];
int tree[N<<2];
inline int lowbit(int x){return x&(-x);}
void insert(int u,int v){for(;u<N<<2;u+=lowbit(u)) tree[u]+=v;}
int answer(int u){int ans=0;for(;u;u-=lowbit(u)) ans+=tree[u];return ans;}
int main()
{
int n,m;
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++) scanf("%d%d",&p[i].l,&p[i].r),p[i].l++,p[i].r++;
sort(p+1,p+n+1);
int u=1;
for(int i=1;i<=m;i++)
{
while(p[u].r-p[u].l+1<i && u<=n)
{
insert(p[u].l,1);
insert(p[u].r+1,-1);
u++;
}
int ans=n-u+1;
for(int j=0;j<=m;j+=i) ans+=answer(j+1);
printf("%d\n",ans);
}
return 0;
}
|
#include<iostream>
#include<algorithm>
#include<cstdio>
using namespace std;
#define N 100127
int n,m,c[N],ans[N];
struct C{int l,r;}q[N*3];
inline bool cmp(C x,C y){return (x.r-x.l)<(y.r-y.l);}
inline void change(int x,int v)
{for(;x<=n;x+=x&(-x))c[x]+=v;}
inline int Ask(int x)
{int res=0;for(;x;x-=x&(-x))res+=c[x];return res;}
int main(){
scanf("%d%d",&m,&n);int i,j,p;
for(i=1;i<=m;i++)scanf("%d%d",&q[i].l,&q[i].r);
sort(q+1,q+m+1,cmp);p=1;
for(i=1;i<=n;i++)
{
while((p<=m)&&(q[p].r-q[p].l+1<i))
{change(q[p].l,1);change(q[p].r+1,-1);++p;}
ans[i]=m-p+1;
for(j=0;j<=n;j+=i)ans[i]+=Ask(j);
}
for(i=1;i<=n;i++)
printf("%d\n",ans[i]);return 0;
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.