A:留坑

B:二维sg函数,特判边界情况

  1. //#pragma GCC optimize(2)
  2. //#pragma GCC optimize(3)
  3. //#pragma GCC optimize(4)
  4. //#pragma GCC optimize("unroll-loops")
  5. //#pragma comment(linker, "/stack:200000000")
  6. //#pragma GCC optimize("Ofast,no-stack-protector")
  7. //#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
  8. #include<bits/stdc++.h>
  9. #define fi first
  10. #define se second
  11. #define db double
  12. #define mp make_pair
  13. #define pb push_back
  14. #define pi acos(-1.0)
  15. #define ll long long
  16. #define vi vector<int>
  17. #define mod 1000000007
  18. #define ld long double
  19. //#define C 0.5772156649
  20. #define ls l,m,rt<<1
  21. #define rs m+1,r,rt<<1|1
  22. #define pll pair<ll,ll>
  23. #define pil pair<int,ll>
  24. #define pli pair<ll,int>
  25. #define pii pair<int,int>
  26. //#define cd complex<double>
  27. #define ull unsigned long long
  28. //#define base 1000000000000000000
  29. #define fin freopen("a.txt","r",stdin)
  30. #define fout freopen("a.txt","w",stdout)
  31. #define fio ios::sync_with_stdio(false);cin.tie(0)
  32. inline ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
  33. inline void sub(ll &a,ll b){a-=b;if(a<0)a+=mod;}
  34. inline void add(ll &a,ll b){a+=b;if(a>=mod)a-=mod;}
  35. template<typename T>inline T const& MAX(T const &a,T const &b){return a>b?a:b;}
  36. template<typename T>inline T const& MIN(T const &a,T const &b){return a<b?a:b;}
  37. inline ll qp(ll a,ll b){ll ans=1;while(b){if(b&1)ans=ans*a%mod;a=a*a%mod,b>>=1;}return ans;}
  38. inline ll qp(ll a,ll b,ll c){ll ans=1;while(b){if(b&1)ans=ans*a%c;a=a*a%c,b>>=1;}return ans;}
  40. using namespace std;
  42. const double eps=1e-8;
  43. const ll INF=0x3f3f3f3f3f3f3f3f;
  44. const int N=100+10,maxn=200000+10,inf=0x3f3f3f3f;
  46. int sg[N][N],Hash[200];
  47. int main()
  48. {
  49.     for(int i=1;i<=100;i++)
  50.     {
  51.         for(int j=1;j<=100;j++)
  52.         {
  53.             if(i==j)continue;
  54.             memset(Hash,0,sizeof Hash);
  55.             for(int k=1;k<i;k++)if(i-k!=j)Hash[sg[i-k][j]]=1;
  56.             for(int k=1;k<j;k++)if(i!=j-k)Hash[sg[i][j-k]]=1;
  57.             for(int k=1;k<min(i,j);k++)if(i-k!=j-k)Hash[sg[i-k][j-k]]=1;
  58.             for(int k=0;;k++)
  59.             {
  60.                 if(!Hash[k])
  61.                 {
  62.                     sg[i][j]=k;
  63.                     break;
  64.                 }
  65.             }
  66. //            printf("%d ",sg[i][j]);
  67.         }
  68. //        puts("");
  69.     }
  70.     int n,ans=0;scanf("%d",&n);
  71.     while(n--)
  72.     {
  73.         int x,y;scanf("%d%d",&x,&y);
  74.         if(x==y)return 0*puts("Y");
  75.         ans^=sg[x][y];
  76.     }
  77.     puts(ans?"Y":"N");
  78.     return 0;
  79. }
  80. /********************
  82. ********************/

C:bit维护逆序对即可

  1. //#pragma GCC optimize(2)
  2. //#pragma GCC optimize(3)
  3. //#pragma GCC optimize(4)
  4. //#pragma GCC optimize("unroll-loops")
  5. //#pragma comment(linker, "/stack:200000000")
  6. //#pragma GCC optimize("Ofast,no-stack-protector")
  7. //#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
  8. #include<bits/stdc++.h>
  9. #define fi first
  10. #define se second
  11. #define db double
  12. #define mp make_pair
  13. #define pb push_back
  14. #define pi acos(-1.0)
  15. #define ll long long
  16. #define vi vector<int>
  17. #define mod 1000000007
  18. #define ld long double
  19. //#define C 0.5772156649
  20. #define ls l,m,rt<<1
  21. #define rs m+1,r,rt<<1|1
  22. #define pll pair<ll,ll>
  23. #define pil pair<int,ll>
  24. #define pli pair<ll,int>
  25. #define pii pair<int,int>
  26. //#define cd complex<double>
  27. #define ull unsigned long long
  28. #define base 1000000000000000000
  29. #define Max(a,b) ((a)>(b)?(a):(b))
  30. #define Min(a,b) ((a)<(b)?(a):(b))
  31. #define fin freopen("a.txt","r",stdin)
  32. #define fout freopen("a.txt","w",stdout)
  33. #define fio ios::sync_with_stdio(false);cin.tie(0)
  34. inline ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
  35. inline void sub(ll &a,ll b){a-=b;if(a<0)a+=mod;}
  36. inline void add(ll &a,ll b){a+=b;if(a>=mod)a-=mod;}
  37. template<typename T>inline T const& MAX(T const &a,T const &b){return a>b?a:b;}
  38. template<typename T>inline T const& MIN(T const &a,T const &b){return a<b?a:b;}
  39. inline ll qp(ll a,ll b){ll ans=1;while(b){if(b&1)ans=ans*a%mod;a=a*a%mod,b>>=1;}return ans;}
  40. inline ll qp(ll a,ll b,ll c){ll ans=1;while(b){if(b&1)ans=ans*a%c;a=a*a%c,b>>=1;}return ans;}
  42. using namespace std;
  44. const double eps=1e-8;
  45. const ll INF=0x3f3f3f3f3f3f3f3f;
  46. const int N=4e5+10,maxn=1000000+10,inf=0x3f3f3f3f;
  48. struct bit{
  49.     int sum[N];
  50.     void init(){memset(sum,0,sizeof sum);}
  51.     void update(int i)
  52.     {
  53.         for(;i<N;i+=i&(-i))sum[i]++;
  54.     }
  55.     int query(int i)
  56.     {
  57.         int ans=0;
  58.         for(;i;i-=i&(-i))ans+=sum[i];
  59.         return ans;
  60.     }
  61. }b;
  62. pii x[N],y[N];
  63. int Hash[N],cnt;
  64. int main()
  65. {
  66.     int xx,yy,h,v;scanf("%d%d%d%d",&xx,&yy,&h,&v);
  67.     for(int i=1;i<=h;i++)scanf("%d%d",&x[i].fi,&x[i].se),Hash[cnt++]=x[i].fi,Hash[cnt++]=x[i].se;
  68.     sort(x+1,x+1+h);sort(Hash,Hash+cnt);cnt=unique(Hash,Hash+cnt)-Hash;
  69.     for(int i=1;i<=h;i++)
  70.     {
  71.         x[i].fi=lower_bound(Hash,Hash+cnt,x[i].fi)-Hash+1;
  72.         x[i].se=lower_bound(Hash,Hash+cnt,x[i].se)-Hash+1;
  73.     }
  74.     cnt=0;
  75.     for(int i=1;i<=v;i++)scanf("%d%d",&y[i].fi,&y[i].se),Hash[cnt++]=y[i].fi,Hash[cnt++]=y[i].se;
  76.     sort(y+1,y+1+v);sort(Hash,Hash+cnt);cnt=unique(Hash,Hash+cnt)-Hash;
  77.     for(int i=1;i<=v;i++)
  78.     {
  79.         y[i].fi=lower_bound(Hash,Hash+cnt,y[i].fi)-Hash+1;
  80.         y[i].se=lower_bound(Hash,Hash+cnt,y[i].se)-Hash+1;
  81.     }
  82.     ll c=0,d=0;
  83.     for(int i=1;i<=h;i++)
  84.     {
  85.         c+=b.query(N-1)-b.query(x[i].se);
  86.         b.update(x[i].se);
  87.     }
  88.     b.init();
  89.     for(int i=1;i<=v;i++)
  90.     {
  91.         d+=b.query(N-1)-b.query(y[i].se);
  92.         b.update(y[i].se);
  93.     }
  94.     printf("%lld\n",1ll*(h+1)*(v+1)+c+d);
  95.     return 0;
  96. }
  97. /********************
  99. ********************/

D:签到

  1. //#pragma GCC optimize(2)
  2. //#pragma GCC optimize(3)
  3. //#pragma GCC optimize(4)
  4. //#pragma GCC optimize("unroll-loops")
  5. //#pragma comment(linker, "/stack:200000000")
  6. //#pragma GCC optimize("Ofast,no-stack-protector")
  7. //#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
  8. #include<bits/stdc++.h>
  9. #define fi first
  10. #define se second
  11. #define db double
  12. #define mp make_pair
  13. #define pb push_back
  14. #define pi acos(-1.0)
  15. #define ll long long
  16. #define vi vector<int>
  17. #define mod 1000000007
  18. #define ld long double
  19. #define C 0.5772156649
  20. #define ls l,m,rt<<1
  21. #define rs m+1,r,rt<<1|1
  22. #define pll pair<ll,ll>
  23. #define pil pair<int,ll>
  24. #define pli pair<ll,int>
  25. #define pii pair<int,int>
  26. //#define cd complex<double>
  27. #define ull unsigned long long
  28. //#define base 1000000000000000000
  29. #define Max(a,b) ((a)>(b)?(a):(b))
  30. #define Min(a,b) ((a)<(b)?(a):(b))
  31. #define fin freopen("a.txt","r",stdin)
  32. #define fout freopen("a.txt","w",stdout)
  33. #define fio ios::sync_with_stdio(false);cin.tie(0)
  34. inline ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
  35. inline void sub(ll &a,ll b){a-=b;if(a<0)a+=mod;}
  36. inline void add(ll &a,ll b){a+=b;if(a>=mod)a-=mod;}
  37. template<typename T>inline T const& MAX(T const &a,T const &b){return a>b?a:b;}
  38. template<typename T>inline T const& MIN(T const &a,T const &b){return a<b?a:b;}
  39. inline ll qp(ll a,ll b){ll ans=1;while(b){if(b&1)ans=ans*a%mod;a=a*a%mod,b>>=1;}return ans;}
  40. inline ll qp(ll a,ll b,ll c){ll ans=1;while(b){if(b&1)ans=ans*a%c;a=a*a%c,b>>=1;}return ans;}
  42. using namespace std;
  44. const double eps=1e-8;
  45. const ll INF=0x3f3f3f3f3f3f3f3f;
  46. const int N=20200+10,maxn=200000+10,inf=0x3f3f3f3f;
  48. int main()
  49. {
  50.     int _,x,ans=0;
  51.     for(scanf("%d",&_);_;_--)
  52.     {
  53.         scanf("%d",&x);
  54.         if(x!=1)ans++;
  55.     }
  56.     printf("%d\n",ans);
  57.     return 0;
  58. }
  59. /********************
  61. ********************/

E:签到

  1. //#pragma GCC optimize(2)
  2. //#pragma GCC optimize(3)
  3. //#pragma GCC optimize(4)
  4. //#pragma GCC optimize("unroll-loops")
  5. //#pragma comment(linker, "/stack:200000000")
  6. //#pragma GCC optimize("Ofast,no-stack-protector")
  7. //#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
  8. #include<bits/stdc++.h>
  9. #define fi first
  10. #define se second
  11. #define db double
  12. #define mp make_pair
  13. #define pb push_back
  14. #define pi acos(-1.0)
  15. #define ll long long
  16. #define vi vector<int>
  17. #define mod 1000000007
  18. #define ld long double
  19. #define C 0.5772156649
  20. //#define ls l,m,rt<<1
  21. //#define rs m+1,r,rt<<1|1
  22. #define pll pair<ll,ll>
  23. #define pil pair<int,ll>
  24. #define pli pair<ll,int>
  25. #define pii pair<int,int>
  26. //#define cd complex<double>
  27. #define ull unsigned long long
  28. //#define base 1000000000000000000
  29. #define Max(a,b) ((a)>(b)?(a):(b))
  30. #define Min(a,b) ((a)<(b)?(a):(b))
  31. #define fin freopen("a.txt","r",stdin)
  32. #define fout freopen("a.txt","w",stdout)
  33. #define fio ios::sync_with_stdio(false);cin.tie(0)
  34. inline ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
  35. inline void sub(ll &a,ll b){a-=b;if(a<0)a+=mod;}
  36. inline void add(ll &a,ll b){a+=b;if(a>=mod)a-=mod;}
  37. template<typename T>inline T const& MAX(T const &a,T const &b){return a>b?a:b;}
  38. template<typename T>inline T const& MIN(T const &a,T const &b){return a<b?a:b;}
  39. inline ll qp(ll a,ll b){ll ans=1;while(b){if(b&1)ans=ans*a%mod;a=a*a%mod,b>>=1;}return ans;}
  40. inline ll qp(ll a,ll b,ll c){ll ans=1;while(b){if(b&1)ans=ans*a%c;a=a*a%c,b>>=1;}return ans;}
  42. using namespace std;
  44. const double eps=1e-8;
  45. const ll INF=0x3f3f3f3f3f3f3f3f;
  46. const int N=10000+10,maxn=200000+10,inf=0x3f3f3f3f;
  48. char s[N],p[N];
  49. int main()
  50. {
  51.     scanf("%s%s",s,p);
  52.     int ls=strlen(s),ps=strlen(p),ans=0;
  53.     for(int i=0;i+ps-1<ls;i++)
  54.     {
  55.         bool f=0;
  56.         for(int j=0;j<ps;j++)if(s[i+j]==p[j]){f=1;break;}
  57.         if(!f)ans++;
  58.     }
  59.     printf("%d\n",ans);
  60.     return 0;
  61. }
  62. /********************
  64. ********************/

F:注意到n很小,开(1<<n)个bit,把区间离散化后按左端点排序,bit维护区间最小值更新即可

  1. //#pragma GCC optimize(2)
  2. //#pragma GCC optimize(3)
  3. //#pragma GCC optimize(4)
  4. //#pragma GCC optimize("unroll-loops")
  5. //#pragma comment(linker, "/stack:200000000")
  6. //#pragma GCC optimize("Ofast,no-stack-protector")
  7. //#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
  8. #include<bits/stdc++.h>
  9. #define fi first
  10. #define se second
  11. #define db double
  12. #define mp make_pair
  13. #define pb push_back
  14. #define pi acos(-1.0)
  15. #define ll long long
  16. #define vi vector<int>
  17. #define mod 1000000007
  18. #define ld long double
  19. #define C 0.5772156649
  20. #define ls l,m,rt<<1
  21. #define rs m+1,r,rt<<1|1
  22. #define pll pair<ll,ll>
  23. #define pil pair<int,ll>
  24. #define pli pair<ll,int>
  25. #define pii pair<int,int>
  26. //#define cd complex<double>
  27. #define ull unsigned long long
  28. //#define base 1000000000000000000
  29. #define Max(a,b) ((a)>(b)?(a):(b))
  30. #define Min(a,b) ((a)<(b)?(a):(b))
  31. #define fin freopen("a.txt","r",stdin)
  32. #define fout freopen("a.txt","w",stdout)
  33. #define fio ios::sync_with_stdio(false);cin.tie(0)
  34. inline ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
  35. inline void sub(ll &a,ll b){a-=b;if(a<0)a+=mod;}
  36. inline void add(ll &a,ll b){a+=b;if(a>=mod)a-=mod;}
  37. template<typename T>inline T const& MAX(T const &a,T const &b){return a>b?a:b;}
  38. template<typename T>inline T const& MIN(T const &a,T const &b){return a<b?a:b;}
  39. inline ll qp(ll a,ll b){ll ans=1;while(b){if(b&1)ans=ans*a%mod;a=a*a%mod,b>>=1;}return ans;}
  40. inline ll qp(ll a,ll b,ll c){ll ans=1;while(b){if(b&1)ans=ans*a%c;a=a*a%c,b>>=1;}return ans;}
  42. using namespace std;
  44. const double eps=1e-8;
  45. const ll INF=0x3f3f3f3f3f3f3f3f;
  46. const int N=2000+10,maxn=100000+10,inf=0x3f3f3f3f;
  48. struct bit{
  49.     int sum[N];
  50.     bit(){memset(sum,-1,sizeof sum);}
  51.     void update(int i,int x)
  52.     {
  53.         for(;i<N;i+=i&(-i))sum[i]=max(sum[i],x);
  54.     }
  55.     int query(int i)
  56.     {
  57.         int ma=-1;
  58.         for(;i;i-=i&(-i))ma=max(ma,sum[i]);
  59.         return ma;
  60.     }
  61. }b[N];
  62. struct node{
  63.     int s,t,v,id;
  64.     bool operator <(const node&rhs)const
  65.     {
  66.         return s<rhs.s || s==rhs.s&&t<rhs.t;
  67.     }
  68. }p;
  69. vector<node>v;
  70. int Hash[N],cnt;
  71. int main()
  72. {
  73.     b[0].update(1,0);
  74.     int n;scanf("%d",&n);
  75.     for(int i=0,k;i<n;i++)for(scanf("%d",&k);k;k--)
  76.     {
  77.         scanf("%d%d%d",&p.s,&p.t,&p.v),p.id=i,v.pb(p);
  78.         Hash[cnt++]=p.s,Hash[cnt++]=p.t;
  79.     }
  80.     sort(Hash,Hash+cnt);cnt=unique(Hash,Hash+cnt)-Hash;
  81.     sort(v.begin(),v.end());
  82.     for(int i=0;i<v.size();i++)
  83.     {
  84.         p=v[i];
  85.         p.s=lower_bound(Hash,Hash+cnt,p.s)-Hash+1;
  86.         p.t=lower_bound(Hash,Hash+cnt,p.t)-Hash+1;
  87. //        printf("%d %d %d %d %d\n",p.s,p.t,p.v,p.id,b[7].query(8));
  88.         for(int j=0;j<(1<<n);j++)
  89.         {
  90.             int x=b[j].query(p.s);
  91.             if(x!=-1)b[j|(1<<p.id)].update(p.t,x+p.v);
  92. //            if(x!=-1&&(j|(1<<p.id))==7)printf("%d %d %d!!!!\n",p.s,p.t,x+p.v);
  93. //            if(j==5&&p.s==7&&p.id==1)printf("%d %d %d***\n",x+p.v,b[5].query(p.s),b[7].query(p.t));
  94.         }
  95.     }
  96.     printf("%d\n",b[(1<<n)-1].query(N-1));
  97.     return 0;
  98. }
  99. /********************
  101. ********************/

G:二分,加最大流,二分图复杂度完全可以接受

  1. //#pragma GCC optimize(2)
  2. //#pragma GCC optimize(3)
  3. //#pragma GCC optimize(4)
  4. //#pragma GCC optimize("unroll-loops")
  5. //#pragma comment(linker, "/stack:200000000")
  6. //#pragma GCC optimize("Ofast,no-stack-protector")
  7. //#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
  8. #include<bits/stdc++.h>
  9. #define fi first
  10. #define se second
  11. #define db double
  12. #define mp make_pair
  13. #define pb push_back
  14. #define pi acos(-1.0)
  15. #define ll long long
  16. #define vi vector<int>
  17. #define mod 1000000007
  18. #define ld long double
  19. //#define C 0.5772156649
  20. #define ls l,m,rt<<1
  21. #define rs m+1,r,rt<<1|1
  22. #define pll pair<ll,ll>
  23. #define pil pair<int,ll>
  24. #define pli pair<ll,int>
  25. #define pii pair<int,int>
  26. //#define cd complex<double>
  27. #define ull unsigned long long
  28. //#define base 1000000000000000000
  29. #define fin freopen("a.txt","r",stdin)
  30. #define fout freopen("a.txt","w",stdout)
  31. #define fio ios::sync_with_stdio(false);cin.tie(0)
  32. inline ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
  33. inline void sub(ll &a,ll b){a-=b;if(a<0)a+=mod;}
  34. inline void add(ll &a,ll b){a+=b;if(a>=mod)a-=mod;}
  35. template<typename T>inline T const& MAX(T const &a,T const &b){return a>b?a:b;}
  36. template<typename T>inline T const& MIN(T const &a,T const &b){return a<b?a:b;}
  37. inline ll qp(ll a,ll b){ll ans=1;while(b){if(b&1)ans=ans*a%mod;a=a*a%mod,b>>=1;}return ans;}
  38. inline ll qp(ll a,ll b,ll c){ll ans=1;while(b){if(b&1)ans=ans*a%c;a=a*a%c,b>>=1;}return ans;}
  40. using namespace std;
  42. const double eps=1e-8;
  43. const ll INF=0x3f3f3f3f3f3f3f3f;
  44. const int N=2000+10,maxn=50000+10,inf=0x3f3f3f3f;
  46. int p,r,c,d[N],E[N],ans;
  47. struct node{
  48.     int a,b,c;
  49.     bool operator <(const node&rhs)const
  50.     {
  51.         return c<rhs.c;
  52.     }
  53. }f[maxn];
  54. struct edge{
  55.     int to,Next,c;
  56. }e[maxn];
  57. int s,t,cnt,head[N],cur[N],dis[N];
  58. void init(){cnt=0;memset(head,-1,sizeof head);}
  59. void add(int u,int v,int c)
  60. {
  61.     e[cnt].to=v;e[cnt].c=c;e[cnt].Next=head[u];head[u]=cnt++;
  62.     e[cnt].to=u;e[cnt].c=0;e[cnt].Next=head[v];head[v]=cnt++;
  63. }
  64. bool bfs()
  65. {
  66.     queue<int>q;
  67.     memset(dis,-1,sizeof dis);
  68.     dis[s]=1;
  69.     q.push(s);
  70.     while(!q.empty())
  71.     {
  72.         int x=q.front();q.pop();
  73.         for(int i=head[x];~i;i=e[i].Next)
  74.         {
  75.             int y=e[i].to;
  76.             if(dis[y]==-1&&e[i].c>0)
  77.             {
  78.                 dis[y]=dis[x]+1;
  79.                 q.push(y);
  80.             }
  81.         }
  82.     }
  83.     return dis[t]!=-1;
  84. }
  85. int dfs(int u,int mx)
  86. {
  87.     if(u==t)return mx;
  88.     int f;
  89.     for(int &i=cur[u];~i;i=e[i].Next)
  90.     {
  91.         int x=e[i].to;
  92.         if(dis[x]==dis[u]+1&&e[i].c>0&&(f=dfs(x,min(mx,e[i].c))))
  93.         {
  94.             e[i].c-=f;
  95.             e[i^1].c+=f;
  96.             return f;
  97.         }
  98.     }
  99.     return 0;
  100. }
  101. int maxflow()
  102. {
  103.     int ans=0,f;
  104.     while(bfs())
  105.     {
  106.         for(int i=0;i<=t;i++)cur[i]=head[i];
  107.         while((f=dfs(s,inf)))ans+=f;
  108.     }
  109.     return ans;
  110. }
  111. bool ok(int x)
  112. {
  113.     init();
  114.     for(int i=1;i<=p;i++)add(i,t,d[i]);
  115.     for(int i=1;i<=r;i++)add(s,p+i,E[i]);
  116.     for(int i=1;i<=c;i++)
  117.     {
  118.         if(f[i].c<=x)add(f[i].b+p,f[i].a,inf);
  119.         else break;
  120.     }
  121.     return maxflow()==ans;
  122. }
  123. int main()
  124. {
  125.     scanf("%d%d%d",&p,&r,&c);
  126.     s=p+r+1,t=p+r+2;
  127.     for(int i=1;i<=p;i++)scanf("%d",&d[i]),ans+=d[i];
  128.     for(int i=1;i<=r;i++)scanf("%d",&E[i]);
  129.     for(int i=1;i<=c;i++)
  130.     {
  131.         int a,b,c;
  132.         scanf("%d%d%d",&a,&b,&c);
  133.         f[i]={a,b,c};
  134.     }
  135.     sort(f+1,f+1+c);
  136.     int l=0,r=f[c].c+1;
  137.     while(l<r-1)
  138.     {
  139.         int m=(l+r)>>1;
  140.         if(ok(m))r=m;
  141.         else l=m;
  142.     }
  143.     printf("%d\n",(r<=f[c].c)?r:-1);
  144.     return 0;
  145. }
  146. /********************
  147. 3 2 5
  148. 20 10 10
  149. 25 30
  150. 1 1 3
  151. 2 1 1
  152. 2 2 4
  153. 3 1 2
  154. 3 2 5
  155. ********************/

H:留坑

I:按题意模拟即可,bitset优化

  1. //#pragma GCC optimize(2)
  2. //#pragma GCC optimize(3)
  3. //#pragma GCC optimize(4)
  4. //#pragma GCC optimize("unroll-loops")
  5. //#pragma comment(linker, "/stack:200000000")
  6. //#pragma GCC optimize("Ofast,no-stack-protector")
  7. //#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
  8. #include<bits/stdc++.h>
  9. #define fi first
  10. #define se second
  11. #define db double
  12. #define mp make_pair
  13. #define pb push_back
  14. #define pi acos(-1.0)
  15. #define ll long long
  16. #define vi vector<int>
  17. #define mod 1000000007
  18. #define ld long double
  19. //#define C 0.5772156649
  20. #define ls l,m,rt<<1
  21. #define rs m+1,r,rt<<1|1
  22. #define pll pair<ll,ll>
  23. #define pil pair<int,ll>
  24. #define pli pair<ll,int>
  25. #define pii pair<int,int>
  26. //#define cd complex<double>
  27. #define ull unsigned long long
  28. //#define base 1000000000000000000
  29. #define fin freopen("a.txt","r",stdin)
  30. #define fout freopen("a.txt","w",stdout)
  31. #define fio ios::sync_with_stdio(false);cin.tie(0)
  32. inline ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
  33. inline void sub(ll &a,ll b){a-=b;if(a<0)a+=mod;}
  34. inline void add(ll &a,ll b){a+=b;if(a>=mod)a-=mod;}
  35. template<typename T>inline T const& MAX(T const &a,T const &b){return a>b?a:b;}
  36. template<typename T>inline T const& MIN(T const &a,T const &b){return a<b?a:b;}
  37. inline ll qp(ll a,ll b){ll ans=1;while(b){if(b&1)ans=ans*a%mod;a=a*a%mod,b>>=1;}return ans;}
  38. inline ll qp(ll a,ll b,ll c){ll ans=1;while(b){if(b&1)ans=ans*a%c;a=a*a%c,b>>=1;}return ans;}
  40. using namespace std;
  42. const double eps=1e-8;
  43. const ll INF=0x3f3f3f3f3f3f3f3f;
  44. const int N=1000+10,maxn=200000+10,inf=0x3f3f3f3f;
  46. bitset<1010>b[N],c;
  47. int main()
  48. {
  49.     int n,m,k,x;
  50.     scanf("%d%d%d",&n,&m,&k);
  51.     for(int i=0;i<k;i++)scanf("%d",&x),c.set(x);
  52.     for(int i=1;i<=n;i++)
  53.     {
  54.         scanf("%d",&k);
  55.         while(k--)scanf("%d",&x),b[i].set(x);
  56.     }
  57.     for(int i=1;i<=n;i++)
  58.     {
  59.         c^=b[i];
  60.         if(c.count()==0)return 0*printf("%d\n",i);
  61.     }
  62.     for(int i=1;i<=n;i++)
  63.     {
  64.         c^=b[i];
  65.         if(c.count()==0)return 0*printf("%d\n",i+n);
  66.     }
  67.     puts("-1");
  68.     return 0;
  69. }
  70. /********************
  72. ********************/

J:斯坦纳树,spfa更新时,只更新后n-k个点,保证不会出现capitals节点连capitals节点

  1. //#pragma GCC optimize(2)
  2. //#pragma GCC optimize(3)
  3. //#pragma GCC optimize(4)
  4. //#pragma GCC optimize("unroll-loops")
  5. //#pragma comment(linker, "/stack:200000000")
  6. //#pragma GCC optimize("Ofast,no-stack-protector")
  7. //#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
  8. #include<bits/stdc++.h>
  9. #define fi first
  10. #define se second
  11. #define db double
  12. #define mp make_pair
  13. #define pb push_back
  14. #define pi acos(-1.0)
  15. #define ll long long
  16. #define vi vector<int>
  17. #define mod 1000000007
  18. #define ld long double
  19. //#define C 0.5772156649
  20. #define ls l,m,rt<<1
  21. #define rs m+1,r,rt<<1|1
  22. #define pll pair<ll,ll>
  23. #define pil pair<int,ll>
  24. #define pli pair<ll,int>
  25. #define pii pair<int,int>
  26. //#define cd complex<double>
  27. #define ull unsigned long long
  28. //#define base 1000000000000000000
  29. #define fin freopen("a.txt","r",stdin)
  30. #define fout freopen("a.txt","w",stdout)
  31. #define fio ios::sync_with_stdio(false);cin.tie(0)
  32. inline ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
  33. inline void sub(ll &a,ll b){a-=b;if(a<0)a+=mod;}
  34. inline void add(ll &a,ll b){a+=b;if(a>=mod)a-=mod;}
  35. template<typename T>inline T const& MAX(T const &a,T const &b){return a>b?a:b;}
  36. template<typename T>inline T const& MIN(T const &a,T const &b){return a<b?a:b;}
  37. inline ll qp(ll a,ll b){ll ans=1;while(b){if(b&1)ans=ans*a%mod;a=a*a%mod,b>>=1;}return ans;}
  38. inline ll qp(ll a,ll b,ll c){ll ans=1;while(b){if(b&1)ans=ans*a%c;a=a*a%c,b>>=1;}return ans;}
  40. using namespace std;
  42. const double eps=1e-8;
  43. const ll INF=0x3f3f3f3f3f3f3f3f;
  44. const int N=100+10,maxn=200000+10,inf=0x3f3f3f3f;
  46. int x[N],y[N],n,k;
  47. db dp[N][(1<<10)+10];
  48. queue<int>q;
  49. bool vis[N];
  50. db cal(int a,int b){return sqrt(1.0*(x[a]-x[b])*(x[a]-x[b])+(y[a]-y[b])*(y[a]-y[b]));}
  51. void spfa(int st)
  52. {
  53.     while(!q.empty())
  54.     {
  55.         int p=q.front();q.pop();
  56.         vis[p]=0;
  57.         for(int i=k;i<n;i++)
  58.         {
  59.             if(i==p)continue;
  60.             db te=cal(p,i);
  61.             if(dp[p][st]+te<dp[i][st])
  62.             {
  63.                 dp[i][st]=dp[p][st]+te;
  64.                 q.push(i);
  65.             }
  66.         }
  67.     }
  68. }
  69. int main()
  70. {
  71.     scanf("%d%d",&n,&k);
  72.     for(int i=0;i<n;i++)for(int j=0;j<(1<<k);j++)dp[i][j]=2e9;
  73.     for(int i=0;i<n;i++)
  74.     {
  75.         scanf("%d%d",&x[i],&y[i]);
  76.         if(i<k)dp[i][1<<i]=0;
  77.     }
  78.     for(int st=0;st<(1<<k);st++)
  79.     {
  80.         for(int i=0;i<n;i++)
  81.         {
  82.             for(int s=st;s;s=(s-1)&st)
  83.                 if(dp[i][s]+dp[i][st-s]<dp[i][st])
  84.                     dp[i][st]=dp[i][s]+dp[i][st-s];
  85.             if(dp[i][st]<inf)q.push(i),vis[i]=1;
  86.         }
  87.         spfa(st);
  88.     }
  89.     db ans=2e9;
  90.     for(int i=k;i<n;i++)ans=min(ans,dp[i][(1<<k)-1]);
  91.     printf("%.5f\n",ans);
  92.     return 0;
  93. }
  94. /********************
  96. ********************/

K:可以发现xy范围很小,两圆相交要满足R-r<=d,d最大是\(sqrt(2)*50\),那么我们按r sort之后,暴力枚举满足该条件的圆即可

  1. #pragma GCC optimize(2)
  2. #pragma GCC optimize(3)
  3. #pragma GCC optimize(4)
  4. //#pragma GCC optimize("unroll-loops")
  5. //#pragma comment(linker, "/stack:200000000")
  6. //#pragma GCC optimize("Ofast,no-stack-protector")
  7. //#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
  8. #include<bits/stdc++.h>
  9. #define fi first
  10. #define se second
  11. #define db double
  12. #define mp make_pair
  13. #define pb push_back
  14. #define pi acos(-1.0)
  15. #define ll long long
  16. #define vi vector<int>
  17. #define mod 1000000007
  18. #define ld long double
  19. //#define C 0.5772156649
  20. #define ls l,m,rt<<1
  21. #define rs m+1,r,rt<<1|1
  22. #define pll pair<ll,ll>
  23. #define pil pair<int,ll>
  24. #define pli pair<ll,int>
  25. #define pii pair<int,int>
  26. //#define cd complex<double>
  27. #define ull unsigned long long
  28. //#define base 1000000000000000000
  29. #define fin freopen("a.txt","r",stdin)
  30. #define fout freopen("a.txt","w",stdout)
  31. #define fio ios::sync_with_stdio(false);cin.tie(0)
  32. inline ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
  33. inline void sub(ll &a,ll b){a-=b;if(a<0)a+=mod;}
  34. inline void add(ll &a,ll b){a+=b;if(a>=mod)a-=mod;}
  35. template<typename T>inline T const& MAX(T const &a,T const &b){return a>b?a:b;}
  36. template<typename T>inline T const& MIN(T const &a,T const &b){return a<b?a:b;}
  37. inline ll qp(ll a,ll b){ll ans=1;while(b){if(b&1)ans=ans*a%mod;a=a*a%mod,b>>=1;}return ans;}
  38. inline ll qp(ll a,ll b,ll c){ll ans=1;while(b){if(b&1)ans=ans*a%c;a=a*a%c,b>>=1;}return ans;}
  40. using namespace std;
  42. const double eps=1e-8;
  43. const ll INF=0x3f3f3f3f3f3f3f3f;
  44. const int N=150000+10,maxn=50000+10,inf=0x3f3f3f3f;
  46. struct circle{
  47.     db x,y,r;
  48.     void read(){scanf("%lf%lf%lf",&x,&y,&r);}
  49.     bool operator <(const circle&rhs)const{
  50.         return r<rhs.r;
  51.     }
  52. }c[N];
  53. bool ok(int i,int j)
  54. {
  55.     db d=sqrt((c[i].x-c[j].x)*(c[i].x-c[j].x)+(c[i].y-c[j].y)*(c[i].y-c[j].y));
  56.     return c[j].r-c[i].r<d&&d<c[i].r+c[j].r;
  57. }
  58. int main()
  59. {
  60.     int n,ans=0;
  61.     scanf("%d",&n);
  62.     for(int i=1;i<=n;i++)c[i].read();
  63.     sort(c+1,c+1+n);
  64.     for(int i=1;i<=n;i++)
  65.     {
  66.         for(int j=i+1;j<=n;j++)
  67.         {
  68.             if(c[j].r-c[i].r>sqrt(2)*50)break;
  69.             else if(ok(i,j))
  70.             {
  71.                 ans+=2;
  72.                 if(ans>2*n)return 0*puts("greater");
  73.             }
  74.         }
  75.     }
  76.     printf("%d\n",ans);
  77.     return 0;
  78. }
  79. /********************
  81. ********************/

L:树链剖分裸题

  1. //#pragma GCC optimize(2)
  2. //#pragma GCC optimize(3)
  3. //#pragma GCC optimize(4)
  4. //#pragma GCC optimize("unroll-loops")
  5. //#pragma comment(linker, "/stack:200000000")
  6. //#pragma GCC optimize("Ofast,no-stack-protector")
  7. //#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
  8. #include<bits/stdc++.h>
  9. #define fi first
  10. #define se second
  11. #define db double
  12. #define mp make_pair
  13. #define pb push_back
  14. #define pi acos(-1.0)
  15. #define ll long long
  16. #define vi vector<int>
  17. #define mod 1000000007
  18. #define ld long double
  19. //#define C 0.5772156649
  20. #define ls l,m,rt<<1
  21. #define rs m+1,r,rt<<1|1
  22. #define pll pair<ll,ll>
  23. #define pil pair<int,ll>
  24. #define pli pair<ll,int>
  25. #define pii pair<int,int>
  26. //#define cd complex<double>
  27. #define ull unsigned long long
  28. //#define base 1000000000000000000
  29. #define fin freopen("a.txt","r",stdin)
  30. #define fout freopen("a.txt","w",stdout)
  31. #define fio ios::sync_with_stdio(false);cin.tie(0)
  32. inline ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
  33. inline void sub(ll &a,ll b){a-=b;if(a<0)a+=mod;}
  34. inline void add(ll &a,ll b){a+=b;if(a>=mod)a-=mod;}
  35. template<typename T>inline T const& MAX(T const &a,T const &b){return a>b?a:b;}
  36. template<typename T>inline T const& MIN(T const &a,T const &b){return a<b?a:b;}
  37. inline ll qp(ll a,ll b){ll ans=1;while(b){if(b&1)ans=ans*a%mod;a=a*a%mod,b>>=1;}return ans;}
  38. inline ll qp(ll a,ll b,ll c){ll ans=1;while(b){if(b&1)ans=ans*a%c;a=a*a%c,b>>=1;}return ans;}
  40. using namespace std;
  42. const double eps=1e-8;
  43. const ll INF=0x3f3f3f3f3f3f3f3f;
  44. const int N=100000+10,maxn=200000+10,inf=0x3f3f3f3f;
  46. struct edge{
  47.     int to,Next;
  48. }e[maxn];
  49. int cnt,head[N];
  50. int son[N],fa[N],top[N],sz[N],id[N];
  51. int res,dep[N];
  52. void add(int u,int v){e[cnt].to=v;e[cnt].Next=head[u];head[u]=cnt++;}
  53. void init()
  54. {
  55.     cnt=0;
  56.     memset(head,-1,sizeof head);
  57.     memset(son,-1,sizeof son);
  58. }
  59. void dfs1(int u,int f,int de)
  60. {
  61.     fa[u]=f;sz[u]=1;
  62.     dep[u]=de;
  63.     for(int i=head[u];~i;i=e[i].Next)
  64.     {
  65.         int v=e[i].to;
  66.         if(v!=f)
  67.         {
  68.             dfs1(v,u,de+1);
  69.             sz[u]+=sz[v];
  70.             if(son[u]==-1||sz[v]>sz[son[u]])son[u]=v;
  71.         }
  72.     }
  73. }
  74. void dfs2(int u,int f,int tp)
  75. {
  76.     top[u]=tp;id[u]=++res;
  77.     if(son[u]!=-1)dfs2(son[u],u,tp);
  78.     for(int i=head[u];~i;i=e[i].Next)
  79.     {
  80.         int v=e[i].to;
  81.         if(v!=f&&v!=son[u])dfs2(v,u,v);
  82.     }
  83. }
  84. int sum[N<<2],lazy[N<<2];
  85. void pushdown(int l,int r,int rt)
  86. {
  87.     if(lazy[rt]!=0)
  88.     {
  89.         int m=(l+r)>>1;
  90.         sum[rt<<1]+=(m-l+1)*lazy[rt];
  91.         sum[rt<<1|1]+=(r-m)*lazy[rt];
  92.         lazy[rt<<1]+=lazy[rt];
  93.         lazy[rt<<1|1]+=lazy[rt];
  94.         lazy[rt]=0;
  95.     }
  96. }
  97. void pushup(int rt)
  98. {
  99.     sum[rt]=sum[rt<<1]+sum[rt<<1|1];
  100. }
  101. void build(int l,int r,int rt)
  102. {
  103.     lazy[rt]=sum[rt]=0;
  104.     if(l==r)return ;
  105.     int m=(l+r)>>1;
  106.     build(ls);build(rs);
  107. }
  108. void update(int L,int R,int c,int l,int r,int rt)
  109. {
  110.     if(L<=l&&r<=R)
  111.     {
  112.         sum[rt]+=(r-l+1)*c;
  113.         lazy[rt]+=c;
  114.         return ;
  115.     }
  116.     pushdown(l,r,rt);
  117.     int m=(l+r)>>1;
  118.     if(L<=m)update(L,R,c,ls);
  119.     if(m<R)update(L,R,c,rs);
  120.     pushup(rt);
  121. }
  122. int query1(int L,int R,int l,int r,int rt)
  123. {
  124.     if(L<=l&&r<=R)return sum[rt];
  125.     pushdown(l,r,rt);
  126.     int m=(l+r)>>1,ans=0;
  127.     if(L<=m)ans+=query1(L,R,ls);
  128.     if(m<R)ans+=query1(L,R,rs);
  129.     return ans;
  130. }
  131. int query(int a,int b)
  132. {
  133.     int f1=top[a],f2=top[b],ans=0;
  134.     while(f1!=f2)
  135.     {
  136.         if(dep[f1]<dep[f2])swap(f1,f2),swap(a,b);
  137.         ans+=query1(id[f1],id[a],1,res,1);
  138.         a=fa[f1],f1=top[a];
  139.     }
  140.     if(dep[a]>dep[b])swap(a,b);
  141.     ans+=query1(id[a],id[b],1,res,1);
  142.     return ans;
  143. }
  144. void change(int a,int b,int c)
  145. {
  146.     int f1=top[a],f2=top[b];
  147.     while(f1!=f2)
  148.     {
  149.         if(dep[f1]<dep[f2])swap(f1,f2),swap(a,b);
  150.         update(id[f1],id[a],c,1,res,1);
  151.         a=fa[f1],f1=top[a];
  152.     }
  153.     if(dep[a]>dep[b])swap(a,b);
  154.     update(id[a],id[b],c,1,res,1);
  155. }
  156. int main()
  157. {
  158.     int n,q;
  159.     scanf("%d%d",&n,&q);
  160.     init();
  161.     for(int i=1;i<n;i++)
  162.     {
  163.         int a,b;scanf("%d%d",&a,&b);
  164.         add(a,b);add(b,a);
  165.     }
  166.     dfs1(1,-1,1);
  167.     dfs2(1,-1,1);
  168.     build(1,res,1);
  169.     while(q--)
  170.     {
  171.         int a,b,c,d;scanf("%d%d%d%d",&a,&b,&c,&d);
  172.         change(a,b,1);
  173.         printf("%d\n",query(c,d));
  174.         change(a,b,-1);
  175.     }
  176.     return 0;
  177. }
  178. /********************
  179. 10 4
  180. 1 4
  181. 4 5
  182. 3 4
  183. 3 2
  184. 7 3
  185. 6 7
  186. 7 8
  187. 10 8
  188. 8 9
  189. 6 10 2 5
  190. 1 9 5 10
  191. 9 10 2 1
  192. 5 10 2 9
  193. ********************/

M:留坑

2018-2019 ACM-ICPC Brazil Subregional Programming Contest的更多相关文章

  1. (寒假GYM开黑)2018-2019 ACM-ICPC Brazil Subregional Programming Contest

    layout: post title: 2018-2019 ACM-ICPC Brazil Subregional Programming Contest author: "luowenta ...

  2. 2018-2019 ACM-ICPC Brazil Subregional Programming Contest PART (10/13)

    $$2018-2019 ACM-ICPC Brazil Subregional Programming Contest$$ \(A.Slackline\ Adventure\) \(B.Marbles ...

  3. 2019-2020 ACM-ICPC Brazil Subregional Programming Contest (11/13)

    \(2019-2020\ ACM-ICPC\ Brazil\ Subregional\ Programming\ Contest\) \(A.Artwork\) 并查集,把检测区域能在一起的检测器放在 ...

  4. ACM ICPC, JUST Collegiate Programming Contest (2018) Solution

    A:Zero Array 题意:两种操作, 1 p v  将第p个位置的值改成v  2  查询最少的操作数使得所有数都变为0  操作为可以从原序列中选一个非0的数使得所有非0的数减去它,并且所有数不能 ...

  5. ACM ICPC, Amman Collegiate Programming Contest (2018) Solution

    Solution A:Careful Thief 题意:给出n个区间,每个区间的每个位置的权值都是v,然后找长度为k的区间,使得这个区间的所有位置的权值加起来最大,输出最大权值, 所有区间不重叠 思路 ...

  6. Gym.101908 Brazil Subregional Programming Contest(寒假自训第六场)

    这几天睡眠时间都不太够,室友晚上太会折腾了,感觉有点累,所以昨天的题解也没写,看晚上能不能补起来. B . Marbles 题意:给定N组数(xi,yi),玩家轮流操作,每次玩家可以选择其中一组对其操 ...

  7. 2013-2014 ACM-ICPC Brazil Subregional Programming Contest 题解

    [题目链接] 这场比赛题面英文都好长... ... A - Zero or One 模拟. #include <bits/stdc++.h> using namespace std; in ...

  8. Codeforces Gym101473 A.Zero or One (2013-2014 ACM-ICPC Brazil Subregional Programming Contest)

    代码: #include<iostream> #include<cstring> #include<cstdio> #include<cmath> #i ...

  9. Codeforces Gym101473 F.Triangles-前缀和 (2013-2014 ACM-ICPC Brazil Subregional Programming Contest)

    前缀和. 代码: 1 #include<iostream> 2 #include<cstring> 3 #include<cstdio> 4 #include< ...

随机推荐

  1. dll注入到指定进程

    talk is cheap,show me code 代码有详细注释 主程序 #include "stdafx.h" #include <windows.h> #inc ...

  2. hdu5628 Clarke and math

    题目地址 题目链接 题意 求 \[ g(i)=\sum_{i1|i}\sum_{i_2|i_1}\sum_{i_3|i_2}...\sum_{i_k|i_{k-1}}f(i_k)\space mod\ ...

  3. demoshow - webdemo展示助手

    demoshow - web demo展示助手 动态图演示页面: http://www.cnblogs.com/daysme/p/6790829.html 一个用来展示前端网页demo的小“助手”,提 ...

  4. js中属性点.和中括号[]的关系。

    本来这里说的是 js 执行一个字符串形式函数的方法. 但是呢看到一个 window['test'] ,居然一下子转不过弯来.这就尴尬了. 不是说好了 [] 和 . 其他都是 “什么的什么” 关系吗?如 ...

  5. 4、Ansible(tags、roles)

    Tags https://docs.ansible.com/ansible/latest/user_guide/playbooks_tags.html http://www.zsythink.net/ ...

  6. codeforces 768D Jon and Orbs

    题目链接:http://codeforces.com/problemset/problem/768/D 令$f[i][j]$表示当前产生过了$i$个球,产生过了$j$个不同的球的概率. ${Ans_i ...

  7. javascript 创建video元素

    <!DOCTYPE html> <html> <body> <h3>演示如何创建 VIDEO 元素</h3> <p>请点击按钮来 ...

  8. Centos7 安装python3.7.2

    下载python3.7.2源码 wget https://www.python.org/ftp/python/3.7.2/Python-3.7.2.tgz 下载完后对压缩包解压缩 tar -xf Py ...

  9. Python 列表list 字典dict

    # coding=utf-8 支持中文 # 列表 n1 = [1, 2, 3] print n1 print len(n1) n1.append(4) print n1 # 字典,包含键值 dic = ...

  10. vue定义全局方法 调用其他组件的方法

    官网的写法  vue实例.$on就可以在根实例上定义全局方法 this.$root就是获取根实例  如果没有根实例 就表示当前实例 this.$root.$on 不需要.eventHub 不需要下面这 ...