Heldivis 码风大赏

Heldivis 的码风变化

2022

6 月

Code

#include<bits/stdc++.h>
using namespace std;
int main()
{
    double a;
    scanf("%lf",&a);
    printf("%.12lf",a);
    return 0;
}

9 月

Code

#include<bits/stdc++.h>
using namespace std;
void dfs(){
    int a;
    cin>>a;
    if(a!=0)
        dfs();
    else    
        return;
    cout<<a<<' ';   
    return;
}
int main(){
    dfs();
    return 0;
}

Code

s,x=map(int,input().split())
Sum=0
Speed=7
flag=1
while(Sum<s-x):
    Sum+=Speed
    Speed=Speed*0.98
if(Sum+Speed>s+x):
    print('n')
else:
    print('y')

11 月

Code

#include<bits/stdc++.h>
using namespace std;
long long n,e,d,m,T,sqrtD;
double D;
int main(){
//  freopen(".txt","w",stdout);
    scanf("%lld",&T);
    while(T--){
        scanf("%lld%lld%lld",&n,&e,&d);
        m=n-e*d+2;
        D=m*m-4*n;
        if(D<0){
            printf("NO\n"); 
            continue;
        }
        sqrtD=sqrt(D);
        if(sqrtD*sqrtD!=D){
            printf("NO\n"); 
            continue;
        }
        if(m<sqrtD||(m+sqrtD)&1){
            printf("NO\n"); 
            continue;
        }printf("%lld %lld\n",(m-sqrtD)/2,(m+sqrtD)/2);
    }
    return 0;
}

2023 年

6 月

Code

#include<bits/stdc++.h>
using namespace std;
const int N=600;
char ch;
int a[N][N],n,m;
int main(){
    scanf("%d%d",&n,&m);
    for(int i=1;i<=n;i++)
        for(int j=1;j<=m;j++){
            cin>>ch;
            a[i][j]=(ch=='#');  
        }
    for(int i=1;i<=n;i++)
        for(int j=1;j<=m;j++)
            if(a[i][j]==0&&(a[i+1][j]+a[i][j+1]+a[i-1][j]+a[i][j-1])>=2){
                printf("%d %d",i,j);
                return 0;   
            }

    return 0;
}

7 月

Code

#include<bits/stdc++.h>
#define int long long
using namespace std;
int read(){
    bool f=1;int res=0;
    char ch=getchar();
    for(;ch>'9'||ch<'0';ch=getchar())
        if(ch=='-') f=0;
    for(;ch>='0'&&ch<='9';ch=getchar())
        res=(res<<1)+(res<<3)+ch-'0';
    return f?res:~res+1; 
}
const int N=1e7+1000,A=1e5+100;
long long ans;int n;
int vis[A];
queue<long long> Q1,Q2;
int work(){
    int x;
    if (Q2.empty()||(!Q1.empty()&&Q1.front()<Q2.front())){
        x=Q1.front();
        Q1.pop();
    }
    else{
        x=Q2.front();
        Q2.pop();
    }
    return x;
}
signed main(){
    n=read();
    for(int i=1;i<=n;i++)
        vis[read()]++;
    for(int i=1;i<=A-100;i++)
        for(int j=1;j<=vis[i];j++)
            Q1.push(i);
    for(int i=1;i<n;i++){
        int x=work(),y=work();
        Q2.push(x+y);
        ans+=x+y;
    }
    printf("%lld",ans);
    return 0;
}

Code

#include<bits/stdc++.h>
#define int long long
#define float double
#define mod %
using namespace std;
const int md=1E9+7;
int read() {
    bool f=1;
    int res=0;
    char ch=getchar();
    for(; ch>'9'||ch<'0'; ch=getchar())
        if(ch=='-')
            f=0;
    for(; ch<='9'&&ch>='0'; ch=getchar())
        res=(res<<1)+(res<<3)+ch-'0';
    return f?res:~res+1;
}
void write(int x) {
    if(x<0)
        putchar('-'),
                x=-x;
    if(x>9)
        write(x/10);
    putchar((x%10)^48);
}
int n,leng,f[800];
string str,sub[800];
signed main() {
//  freopen(".in","r",stdin);
//  freopen(".out","w",stdout);
    n=read();
    leng=read();
    cin>>str;
    str=' '+str;
    for(int i=1; i<=n; i++) {
        cin>>sub[i];
        sub[i]=' '+sub[i];
    }
    memset(f,0x3f,sizeof f);
    f[0]=0;
    for(int i=1; i<=leng; i++) {
        f[i]=f[i-1]+1;
        for(int j=1; j<=n; j++) {
            int id=i,cnt=sub[j].size()-1;
            while(cnt>0 and id>0) {
                if(str[id]==sub[j][cnt]) {
                    id--;
                    cnt--;
                } else
                    id--;
            }
            if(id>=0 and cnt==0)
                if (f[id]+i-id+1-sub[j].size()<f[i])
                    f[i]=f[id]+i-id+1-sub[j].size();
                
        }
    }
    write(f[leng]);
    return 0;
}

Code

#include <bits/stdc++.h>
#define mod %
using namespace std;
int read() {
    int res = 0;
    bool flag = 1;
    char ch = getchar();
    for (; ch > '9' || ch < '0'; ch = getchar())
        if (ch == '-')
            flag = 0;
    for (; ch >= '0' && ch <= '9'; ch = getchar())
        res = (res << 1) + (res << 3) + ch - '0';
    return flag ? res : ~res + 1;
}
const int N = 1E6 + 10;
char s1[N], s2[N];
int i = 1, j = 1, n, f = -1, cnt = 1;
signed main() {
    cin >> (s1 + 1);
    cin >> (s2 + 1);
    n = strlen(s1 + 1);
    while (i <= n + 1 and j <= n) {
        while (s1[i] != s2[j]) {
            i++;
            if (f == -1)
                f = j;
            else {
                printf("0\n");
                return 0;
            }
            if (i > n + 1){
                printf("0\n");
                return 0;
            }
        }
        i++, j++;
    }
    for (int i = f; i <= n + 1; i++)
        if (s1[i] == s1[i + 1])
            cnt++;
        else
            break;
    while (f)
        if (s1[f] == s1[f - 1])
            f--, cnt++;
        else
            break;
    printf("%d\n", cnt);
    for (int i = f, j = 1; j <= cnt; i++, j++)
        printf("%d ", i);
    return 0;
}

10 月

Code

#include<bits/stdc++.h>
using namespace std;

const int N=10;
int n,ans,b[N],a[N][N];

void dfs(int x){
    if(x>5){
        bool flag=true;
        int pos,cnt;
        for(int i=1;i<=n;++i){
            pos=cnt=0;
            for(int j=1;j<=5;++j){
                if(a[i][j]!=b[j]){
                    ++cnt;
                    if(cnt>2){
                        flag=false;
                        break;
                    }
                    if(!pos) pos=j;
                    else if(pos==j-1){
                        int tmp1=b[j-1]-a[i][j-1],tmp2=b[j]-a[i][j];
                        if(tmp1<0) tmp1+=10;
                        if(tmp2<0) tmp2+=10;
                        if(tmp1!=tmp2){
                            flag=false;
                            break;
                        }
                    }
                    else{
                        flag=false;
                        break;
                    }
                }
            }
            if(!cnt) flag=false;
            if(!flag) break;
        }
        if(flag) ++ans;
        return;
    }
    for(int i=0;i<=9;++i){
        b[x]=i;
        dfs(x+1);
    }
    return;
}

int main()
{
    cin>>n;
    for(int i=1;i<=n;++i)
        for(int j=1;j<=5;++j) scanf("%d",&a[i][j]);
    dfs(1);
    cout<<ans<<endl;
    return 0;
}

（此前四格空格皆为 \t。）

2024 年

3 月

Code

#include <bits/stdc++.h>
using namespace std;
int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    int x;
    cin >> x;
    cout << char(x);
    return 0;
}

4 月

Code

#include <bits/stdc++.h>
using namespace std;
int read(){
    int res = 0;
    bool f = true;
    char ch = getchar();
    for(; ch > '9' || ch < '0'; ch = getchar())
        if (ch == '-')
            f = false;
    for(; ch <= '9' && ch >= '0'; ch = getchar())
        res = (res << 3) + (res << 1) + (ch ^ 48);
    return f ? res : ~ res + 1;
}
int t, a, b;
signed main() {
    while (1);
    t = read();
    while (t--) {
        a = read();
        b = read();
        printf("%d\n", a+b);
    }
    return 0;
}

6 月

Code

#include <bits/stdc++.h>
#define int long long
using namespace std;
struct Node {
  int x, y, w;
};
int n, sx, sy, fx, fy;
Node Get(int x, int y, int f) {
  int a = (x - 1) / n, b = (y - 1 ) / n;
  if ((a + b) & 1)
    return {a, b, 0};
  if (f == 1) return {a + 1, b, n*(a + 1) - x + 1};
  if (f == 2) return {a - 1, b, x - n * a};
  if (f == 3) return {a, b + 1, n*(b + 1) - y + 1};
  if (f == 4) return {a, b - 1, y - n * b};
}
int Fn(Node a, Node b) {
  int dx = abs(a.x - b.x), dy = abs(a.y - b.y);
  int res = a.w + b.w + max(dx, dy) * 2;
  if (n <= 2) res -= abs(dx - dy) / 2;
  return res;
}
signed main() {
  cin >> n >> sx >> sy >> fx >> fy;
  sx++, sy++, fx++, fy++;
  int res = abs(sx - fx) + abs(sy - fy);
  for (int i = 1; i <= 4; i++)
    for (int j = 1; j <= 4; j++)
      res = min(res, Fn(Get(sx, sy, i), Get(fx, fy, j)));
  cout << res;
  return 0;
}

Code

N = 114514
tl, tr, dat, tag = [0] * (N * 4), [0] * (N * 4), [0] * (N * 4), [0] * (N * 4)
a = [0] * N

def Upd(p):
  dat[p] = dat[p * 2] + dat[p * 2 + 1]

def Spread(p):
  tag[p * 2] += tag[p]
  dat[p * 2] += (tr[p * 2] - tl[p * 2] + 1) * tag[p]
  tag[p * 2 + 1] += tag[p]
  dat[p * 2 + 1] += (tr[p * 2 + 1] - tl[p * 2 + 1] + 1) * tag[p]
  tag[p] = 0

def Build(p, l, r):
  tl[p] = l
  tr[p] = r
  if l == r:
    dat[p] = a[l]
    return
  mid = (l + r) // 2
  Build(p * 2, l, mid)
  Build(p * 2 + 1, mid + 1, r)
  Upd(p)

def Change(p, l, r, d):
  if l <= tl[p] and tr[p] <= r:
    tag[p] += d
    dat[p] += d * (tr[p] - tl[p] + 1)
    return
  Spread(p)
  mid = (tl[p] + tr[p]) // 2
  if l <= mid:
    Change(p * 2, l, r, d)
  if mid < r:
    Change(p * 2 + 1, l, r, d)
  Upd(p)

def Ask(p, l, r):
  if l <= tl[p] and tr[p] <= r:
    return dat[p]
  Spread(p)
  mid = (tl[p] + tr[p]) // 2
  res = 0
  if l <= mid:
    res += Ask(p * 2, l, r)
  if mid < r:
    res += Ask(p * 2 + 1, l, r)
  return res

n, q = map(int, input().split())
s = input().split()
for i in range(n):
  a[i + 1] = int(s[i])
Build(1, 1, n)
for _ in range(q):
  opt = input().split()
  if (opt[0] == '1'):
    Change(1, int(opt[1]), int(opt[2]), int(opt[3]))
  else:
    print(Ask(1, int(opt[1]), int(opt[2])))
# 常数太大，T 飞了

7 月

Code

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define uint unsigned long long
int read() {
  int res = 0;
  bool f = true;
  char ch = getchar();
  for (; ch > '9' || ch < '0'; ch = getchar())
    if (ch == '-')
      f = false;
  for (; ch <= '9' && ch >= '0'; ch = getchar())
    res = (res << 3) + (res << 1) + (ch ^ 48);
  return f ? res : ~res + 1;
}

const int N = 1E5 + 100, P = 13331;
struct Fuck {
  uint hash_val, mi;
  int len;
} s[N];
char str[N], tmp[N];
int n, q;
void Heldivis() {
  scanf("%s", str + 1);
  n = strlen(str + 1);
  q = read();
  for (int i = 1; i <= q; i++) {
    scanf("%s", tmp + 1);
    s[i].len = strlen(tmp + 1), s[i].mi = 1;
    for (int j = 1; j <= s[i].len; j++) {
      s[i].hash_val = s[i].hash_val * P + tmp[j];
      s[i].mi = s[i].mi * P;
    }
  }
  vector<char> res;
  vector<uint> sta;
  sta.push_back(0);
  for (int i = 1; i <= n; i++) {
    sta.push_back(sta.back() * P + str[i]);
    res.push_back(str[i]);
    for (int j = 1; j <= q; j++) {
      if (sta.size() > s[j].len &&
          sta.back() - sta[sta.size() - s[j].len - 1] * s[j].mi ==
              s[j].hash_val) {
        for (int t = 1; t <= s[j].len; t++) {
          sta.pop_back();
          res.pop_back();
        }
      }
    }
  }
  for (char i : res)
    putchar(i);
  putchar('\n');
}

signed main() {
#ifdef ____
  freopen(".in", "r", stdin);
  freopen(".out", "w", stdout);
  double _START_TIME = clock();
#endif
  int _T = 1; // read() or  1
  while (_T--)
    Heldivis();
#ifdef ____
  double _END_TIME = clock();
  printf("\n%.0lf ms\n", (_END_TIME - _START_TIME) / CLOCKS_PER_SEC * 1000);
#endif
  return 0;
}

10 月

Code

#include <bits/stdc++.h>

#include "railroad.h"

using namespace std;
using re = double;
using ll = long long;
using pii = pair<int, int>;

const int Inf = 1E9;

long long plan_roller_coaster(std::vector<int> s, std::vector<int> t) {
  int n;
  ll res = 0;
  s.push_back(Inf), t.push_back(1), n = s.size();
  vector<int> val;
  for (const int &i : s) val.push_back(i);
  for (const int &i : t) val.push_back(i);
  sort(val.begin(), val.end());
  int w = unique(val.begin(), val.end()) - val.begin();
  vector<int> fa(w);
  iota(fa.begin(), fa.end(), 0);
  const auto gf = [&](auto &&self, const int &x) -> int { return x == fa[x] ? x : fa[x] = self(self, fa[x]); };
  const auto mrg = [&](const int &x, const int &y) -> void { fa[gf(gf, x)] = gf(gf, y); };
  const auto qry = [&](const int &x, const int &y) -> bool { return gf(gf, x) == gf(gf, y); };
  vector<int> d(w);
  for (int i = 0; i < n; ++i) {
    s[i] = lower_bound(val.begin(), val.begin() + w, s[i]) - val.begin();
    t[i] = lower_bound(val.begin(), val.begin() + w, t[i]) - val.begin();
    ++d[s[i]], --d[t[i]], mrg(s[i], t[i]);
  }
  for (int i = 1; i < w; ++i) d[i] += d[i - 1];
  for (int i = 0; i < w - 1; ++i)
    if (d[i] != 0) {
      mrg(i, i + 1);
      if (d[i] > 0) res += 1ll * d[i] * (val[i + 1] - val[i]);
    }
  struct Edge {
    int x, y, w;
  };
  vector<Edge> e;
  for (int i = 0; i < w - 1; ++i)
    if (!qry(i, i + 1)) e.push_back({i, i + 1, val[i + 1] - val[i]});
  sort(e.begin(), e.end(), [&](const Edge &x, const Edge &y) { return x.w < y.w; });
  for (const auto &[x, y, w] : e) {
    if (qry(x, y)) continue;
    mrg(x, y), res += w;
  }
  return res;
}

#ifdef CPH
signed main() {
  const function<int(void)> read = []() -> int {
    int res = 0, f = 1, ch = getchar();
    while (!isdigit(ch)) (ch == '-') && (f = 0), ch = getchar();
    while (isdigit(ch)) res = res * 10 + (ch ^ 48), ch = getchar();
    return f ? res : ~res + 1;
  };
  int n = read(), m = read();
  vector<int> s(n), t(n);
  for (int i = 0; i < n; ++i) s[i] = read(), t[i] = read();
  printf("%lld\n", plan_roller_coaster(s, t));
  return 0;
}
#endif

11 月

Code

#include <algorithm>
#include <cstdio>
#include <vector>
long long n, m, res;
std::vector<int> col, row;
signed main() {
  scanf("%lld%lld", &n, &m), row.resize(n), col.resize(m);
  for (int &i : row) scanf("%d", &i);
  for (int &i : col) scanf("%d", &i);
  std::sort(row.begin(), row.end()), std::sort(col.begin(), col.end());
  res += row[0] * --m + col[0] * --n;
  auto i = next(row.begin()), j = next(col.begin());
  while (i != row.end() && j != col.end())
    (*i < *j) ? (res += *i++ * m, --n) : (res += *j++ * n, --m);
  printf("%lld\n", res);
  return 0;
}