扣脚老骚

L2-031 深入虎穴 (25分)#include <bits/stdc++.h>#define int ll//#pragma GCC optimize(2)using namespace std;typedef long long ll;const int maxn = 1e5 + 10;vector<int > ve[maxn];int vis[maxn];int id,dis;int dfs(int fa,int d){ if(ve[fa].

L2-030 冰岛人 (25分)#include <bits/stdc++.h>#define int ll//#pragma GCC optimize(2)using namespace std;typedef long long ll;const int maxn = 1e6 + 10;struct per{ string father; int sex;};unordered_map<string ,per> person;int j

L1-064 估值一亿的AI核心代码 (20分)#include <bits/stdc++.h>#define int ll//#pragma GCC optimize(2)using namespace std;typedef long long ll;const int maxn=1e5+10;void solve() { string str[1005]; int cnt=0; string s; getline(cin,s); c

L1-059 敲笨钟 (20分)#include <bits/stdc++.h>#define int ll//#pragma GCC optimize(2)using namespace std;typedef long long ll;const int maxn=1e5+10;string s;void solve() { getline(cin,s); int f1=0,f2=0,num=0; for (int i = 0; i < s

L2-027 名人堂与代金券 (25分)#include <bits/stdc++.h>#define int ll#pragma GCC optimize(2)using namespace std;typedef long long ll;const int maxn=1e4+10;struct zh{ string name; int fs;}a[maxn];bool cmp(zh a,zh b){ if (a.fs!=b.fs) return

L2-026 小字辈 (25分)#include <bits/stdc++.h>#define int ll#pragma GCC optimize(2)using namespace std;typedef long long ll;const int maxn=1e5+10;int n;vector<int > a[maxn];int ans[maxn];int de=1,top=0,f;int dfs(int x,int d){ int nu

L1-049 天梯赛座位分配 (20分)#include <bits/stdc++.h>#define int ll#pragma GCC optimize(2)using namespace std;typedef long long ll;const int maxn=3e5+10;int f[105],m[105];void solve() { int n,sum=0,num=0,dui=0; cin>>n; for (int i =

L3-009 长城 (30分)#include <bits/stdc++.h>//#define int llusing namespace std;//#pragma GCC optimize(2)#define int lltypedef long long ll;const ll mod = 1e9 + 7;const int maxn = 1e5 + 10;int x[maxn],y[maxn],a[maxn],b[maxn]={0};bool check(in

L3-015 球队“食物链” (30分)#include <bits/stdc++.h>//#define int llusing namespace std;//#pragma GCC optimize(2)typedef long long ll;const ll mod = 1e9 + 7;const int maxn = 1e3 + 10;int n,f=0;int a[25][25]={0},b[25]={0},c[25];void dfs(int x,in

L1-3 宇宙无敌加法器 (20分)#include <bits/stdc++.h>//#define int llusing namespace std;//#pragma GCC optimize(2)typedef long long ll;const ll mod = 1e9 + 7;const int maxn = 1e5 + 10;string s;char d[25];int num=0;int jia(int x,int y,int yu,int i

L2-002 链表去重 (25分)#include <bits/stdc++.h>//#define int llusing namespace std;//#pragma GCC optimize(2)typedef long long ll;const ll mod = 1e9 + 7;const int maxn = 1e6 + 10;struct node{ int id,k,next;}a[maxn],c[maxn],d[maxn];int b[10