2023天梯赛
L1-1
#include
#include
#include
#include
#include
#define x first
#define y second
using namespace std;
using LL = long long;
typedef pair PII;
void solve()
{
cout << "Good code is its own best documentation." << endl;
}
int main()
{
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int _ = 1;
while (_--) solve();
return 0;
} L1-2
#include
#include
#include
#include
#include
#define x first
#define y second
using namespace std;
using LL = long long;
typedef pair PII;
int a, b;
void solve()
{
cin >> a >> b;
cout << a + b - 16 << endl;
cout << a + b - 3 << endl;
cout << a + b - 1 << endl;
cout << a + b << endl;
}
int main()
{
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int _ = 1;
while (_--) solve();
return 0;
} L1-3
#include
#include
#include
#include
#include
#define x first
#define y second
using namespace std;
using LL = long long;
typedef pair PII;
int n, m, k;
string x;
void solve()
{
cin >> n >> x >> m >> k;
if (k == n) cout << "mei you mai " << x << " de" << endl;
else if (k == m) cout << "kan dao le mai " << x << " de" << endl;
else cout << "wang le zhao mai " << x << " de" << endl;
}
int main()
{
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int _ = 1;
while (_--) solve();
return 0;
} L1-4
#include
#include
#include
#include
#include
#define x first
#define y second
using namespace std;
using LL = long long;
typedef pair PII;
int n;
void solve()
{
cin >> n;
while(n--)
{
int a,b,c;
cin >> a >> b >> c;
if (c == a * b) cout << "Lv Yan" << endl;
else if (c == a + b) cout << "Tu Dou" << endl;
else cout << "zhe du shi sha ya!" << endl;
}
}
int main()
{
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int _ = 1;
while (_--) solve();
return 0;
} L1-5
#include
#include
#include
#include
#include
#define x first
#define y second
using namespace std;
using LL = long long;
typedef pair PII;
const int N = 110;
int n,m;
int a[N];
void solve()
{
cin >> n;
for (int i = 1;i <= n;i++)
cin >> a[i];
cin >> m;
while(m--)
{
bool all_no = false;
bool wrong = false;
bool no_win =false;
for (int i = 1;i <= n;i++)
{
int x;
cin >> x;
if (x == a[i])
{
all_no = true;
no_win = true;
}
if (x + a[i] == 3)
{
wrong = true;
all_no = true;
}
}
if (wrong == false && no_win) cout << "Da Jiang!!!" << endl;
if (!all_no || wrong) cout << "Ai Ya" << endl;
}
}
int main()
{
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int _ = 1;
while (_--) solve();
return 0;
} L1-6 （寄了）
s.substr(a,b)，a是所截取的子串在原始字符串的起始位置，而b则是截取长度，不是子串的终止位置！
#include
#include
#include
#include
#include 改正后
#include
#include
#include
#include
#include 二次
#include
#include
#include
#include
#include
#include
#define x first
#define y second
#define endl '\n'
using namespace std;
using LL = long long;
typedef pair PII;
string s;
int n;
string tmp1,tmp2;
int st,ed;
string t;
void solve()
{
cin >> s;
cin >> n;
for (int i = 0;i < n; i++)
{
cin >> st >> ed;
cin >> tmp1 >> tmp2;
int len = tmp1.size();
tmp1 += tmp2;
t = s.substr(st - 1,ed - st + 1);
// cout << t << endl;
// cout << tmp1 << endl;
s.erase(st - 1,ed - st + 1);
// cout << s << endl;
// cout << s.find(tmp1) << endl;
int id = s.find(tmp1); // 第一次出现的下标
// cout << id << endl;
if (id != -1)
{
s.insert(id + len,t);// 从下标开始插入
}
else s.insert(s.size(),t);
}
cout << s << endl;
}
int main()
{
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int _ = 1;
while (_--) solve();
return 0;
} L1-7 19分（wa了1分）
#include
#include
#include
#include
#include 3小时才做到这
撒狗粮
#include
#include
#include
#include
#include
#include
#include
L2-1 堆宝塔
#include
#define endl '\n'
using namespace std;
const int N = 1010;
vector a,b;
//vector c[N];
int n;
int cnt;
int maxn;
void solve()
{
cin >> n;
for (int i = 0;i < n;i ++)
{
int x;
cin >> x;
if (i == 0) a.push_back(x);
else
{
if (x < a.back()) a.push_back(x);
else
{
if (b.size() == 0 || x > b.back()) b.push_back(x);
else
{
maxn = max(maxn,(int)a.size());
a.clear();cnt++;
for (int i = b.size() - 1;i >= 0;i--)
if (b[i] > x)
{
a.push_back(b[i]);
b.pop_back();
}
a.push_back(x);
}
}
}
}
if (a.size()) maxn = max(maxn,(int)a.size()),cnt++;
if (b.size()) maxn = max(maxn,(int)b.size()),cnt++;
cout << cnt << ' ' << maxn << endl;
}
int main()
{
ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
int _ = 1;
while(_--) solve();
return 0;
}
L2-2 天梯赛的赛场安排 寄
#include
using namespace std;
using LL = long long;
const int N = 5010, M = 60;
int n,m;
int cnt;
map mp;
string s[N];
void solve()
{
cin >> n >> m;
for (int i = 0;i < n;i ++)
{
string sp;
int cp;
cin >> sp >> cp;
int tmp = cp / m;
if (cp % m) tmp++;
mp[sp] = cp;s[i] = sp;
cout << sp << " " << tmp << endl;
}
// for (int i = 0;i < n;i ++)
// {
// cout << s[i] << ' ' << mp[s[i]] << endl;
// }
}
int main()
{
ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
int _ = 1;
while(_--) solve();
return 0;
} L2-4 寻宝图 24/25 （内存超限1个点）
#include
#define endl '\n'
#define x first
#define y second
using namespace std;
using LL = long long;
typedef pair PII;
const int N = 10010;
char g[N][N];
bool st[N][N];
queue q;
int n,m;
int cnt1,cnt2;
int dx[] = {-1,0,1,0},dy[] = {0,1,0,-1};
void bfs(int sx,int sy)
{
q.push({sx,sy});
st[sx][sy] = true;
bool has_bao = false;
while(q.size())
{
auto t = q.front();
q.pop();
for (int i = 0;i < 4;i ++)
{
int a = t.x + dx[i],b = t.y + dy[i];
if (a < 0 || a >= n || b < 0 || b >= m) continue;
if (st[a][b]) continue;
if (g[a][b] == '0') continue;
if (g[a][b] >= '2' && g[a][b] <= '9') has_bao = true;
st[a][b] = true;
q.push({a,b});
}
}
if (has_bao) cnt2 ++;
}
void solve()
{
cin >> n >> m;
for (int i = 0;i < n;i ++)
for (int j = 0;j < m;j ++)
cin >> g[i][j];
for (int i = 0;i < n;i ++)
for (int j = 0;j < m;j ++)
{
if (!st[i][j] && g[i][j] != '0')
{
cnt1 ++;bfs(i,j);
}
}
cout << cnt1 << " " << cnt2 << endl;
}
int main()
{
ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
int _ = 1;
while(_--) solve();
return 0;
}