int>PII;#define ft first#define sd secondconstintN=1e6+10;constintmod=998244353;intn,m;set<PII>st;voidcheck(intx,inty){if(x>=1&&x<=n&&y>=1&&y<=n)st.insert({x,y});}voidsolve(){cin>>n>>m;intans=n*n;for(intid=1;id<=...
A - Candy Button 根据题意模拟一下就行 #include<bits/stdc++.h>usingll=longlong;usingnamespacestd;intn,c,now,ans;intmain(){ios::sync_with_stdio(false);cin.tie(nullptr);cin>>n>>c;cin>>now;ans++;for(inti=2;i<=n;i++){intx;cin>>x;if(x-now>=c){now=x;++ans;}}cout<<ans<...
Toyota Programming Contest 2024#3(AtCoder Beginner Contest 344)A - Spoiler代码:highlighter- arduino #include <bits/stdc++.h> using namespace std; using ll = long long; using pii = pair<ll, ll>; typedef double db; #define fi first #define se second using i128 = __int128_t; using ...
AtCoder Beginner Contest 169(题解) AtCoder Beginner Contest 169(题解)E - Count Median结论题给定nnn个xi∈[ai,bi]x_i\in[a_i,b_i]xi∈[ai,bi],求中位数的个数。定义:k=⌊n2⌋k=\lfloor\dfrac{n}{2}\rfloork=⌊2n⌋,对a,ba,ba,b进行排序后,为ak+1a_{k+1}ak...
KYOCERA Programming Contest 2021(AtCoder Beginner Contest 200) 题目链接https://atcoder.jp/contests/abc200 A - Century 简单的abs(n-1)/100+1即可 B - 200th ABC-200 按题意写代码点击查看代码 void solve(){ int n,k;cin>>n>>k; for(int i=1;i<=k;i++) { if(n%200==0)n/=200;...
AtCoder Beginner Contest 343(A-D) Harryxxy关注IP属地: 江苏 0.0892024.03.03 00:12:51字数117阅读55 A - Wrong Answer 签到题 数据随便填 #include<iostream> using namespace std; int A, B; int c; int ans; int main() { cin >> A >> B; c = A + B; if (c == 0) { ans = 1;...
#include<iostream>#includeusing namespace std;intmain(){int t;cin>>t;int num1=0,num2=0,num3=0,num4=0;while(t--){string s;cin>>s;if(s=="AC")num1++;if(s=="WA")num2++;if(s=="TLE")num3++;if(s=="RE")num4++;}cout<<"AC x "<<num1<<endl;cout<<"WA x "<<num...
AtCoder Beginner Contest 224 问题D：8 Puzzle on Graph 问题描述：在无向图中，9个点和m条边形成，其中有8块拼图分别位于其中8个点上，一个点上没有拼图。每块拼图可移动至没有拼图的点。任务是求解最少操作次数使得第i块拼图位于点i上，若无法实现则输出-1。思路：经典“八数码问题”。使用map...
AtCoder ABC227. Atcoder Beginner Contest 227 (C ~ G) 原题链接困难 作者: wkingyu , 2024-10-02 01:34:59 , 所有人可见 , 阅读 24 2 C.C. 给你一个整数 N≤1011N≤1011,问有多少对 A≤B≤CA≤B≤C 满足ABC≤NABC≤N 思路:AAA≤ABC≤NAAA≤ABC≤N,得到 A≤NA≤N,用 NN 的最大...
ps: 本想只写个G的,感觉内容有点少,写个f水下内容,顺便等cf重测。写了依托 #defineintlonglongconstintN=2e5+5;constintmaxn=2e5;intn,m,k;inta[N],c[N],v[N],f[N],b[N];map<int,vector<int>>mp[N];intlowbit(intx){returnx&-x;}intsum(intx){intans=0;while(x){ans=max(ans,...