CCF CSP
CSP题解
Spikeeee-
消磨到死的那些希望的亡灵:苍白、凄惨、哭的哀伤。
展开
-
CCF 202009-4 星际旅行
#include <bits/stdc++.h>#define ll long long#define _for(i, a, b) for (ll i = (a); i < (b); ++i)#define sc scanf#define pr printf#define TLE \ ios::sync_with_stdio(false); \ cin.tie(0);const int maxn = 1e5 + 5;c原创 2020-11-30 21:05:34 · 275 阅读 · 0 评论 -
CCF 202009-1 称检测点查询
#include<bits/stdc++.h>#define TLE ios::sync_with_stdio(0),cin.tie(0)#define long long llconst int INF = 0x3f3f3f3f;const int maxn = 1005;using namespace std;struct Node{ int d,id;}node[maxn];bool cmp(Node a,Node b){ if(a.d == b.d) return a原创 2020-10-11 14:13:29 · 1039 阅读 · 4 评论 -
CCF 202009-2 风险人群筛查
#include<bits/stdc++.h>#define TLE ios::sync_with_stdio(0),cin.tie(0)#define long long llconst int INF = 0x3f3f3f3f;const int maxn = 10005;using namespace std;struct Node{ int x, y;}node[maxn];int main(){ TLE; int n,k,t,xl,yd,xr,yu; cin&g原创 2020-10-11 14:12:39 · 264 阅读 · 0 评论 -
CCF 202009-3 点亮数字人生(拓扑排序)
#include<bits/stdc++.h>#define TLE ios::sync_with_stdio(0),cin.tie(0)#define long long llconst int INF = 0x3f3f3f3f;const int maxn = 2 * 10005;using namespace std;map<string, int> mp;int Opter[maxn], In[maxn], InDeg[maxn], k, m, n, T, s,原创 2020-10-05 15:55:42 · 596 阅读 · 0 评论 -
CCF 模拟2-1 夏令营
AC码:#include <cstring>#include <string.h>#include <iostream>#include <stdio.h>#include <algorithm>#include <cmath>#include <cstring>#include <string>#include <vector>#define ll long long#def.原创 2020-09-05 21:48:56 · 137 阅读 · 0 评论 -
CCF 模拟2-2 导医护士
AC码:#include <cstring>#include <string.h>#include <iostream>#include <stdio.h>#include <algorithm>#include <cmath>#include <cstring>#include <string>#include <vector>#define ll long long#de..原创 2020-09-05 21:52:43 · 131 阅读 · 0 评论 -
CCF 模拟2-3 找呀找呀找朋友
考试前半段吃饭去了,不知道满没满 后补的代码…#include <cstring>#include <string.h>#include <iostream>#include <stdio.h>#include <algorithm>#include <cmath>#include <cstring>#include <string>#include <vector>#incl..原创 2020-09-05 21:45:00 · 103 阅读 · 0 评论 -
CCF 模拟2-4 最短时间
50分还没改:#include <cstring>#include <string.h>#include <iostream>#include <stdio.h>#include <algorithm>#include <cmath>#include <cstring>#include <string>#include <vector>#define ll long long..原创 2020-09-05 21:55:56 · 126 阅读 · 0 评论 -
CCF 202006-1 线性分类器
#include<iostream>#include<algorithm>#include<string.h>#include<cstdio>using namespace std;const int maxn = 5e4 + 100;#define TLE ios::sync_with_stdio(0),cin.tie(0)const int INF = 0x3f3f3f3f;int x[maxn], y[maxn];char s[maxn原创 2020-08-06 21:24:16 · 203 阅读 · 0 评论 -
CCF 202006-2 稀疏向量
#include<iostream>#include<algorithm>#include<string.h>#include<cstdio>#include<map>using namespace std;const int maxn = 5e4 + 100;#define TLE ios::sync_with_stdio(0),cin.tie(0)const int INF = 0x3f3f3f3f;#define ll lo原创 2020-08-06 21:50:52 · 254 阅读 · 0 评论 -
CCF 202006-3 Markdown渲染器
#include <cstring>#include <string.h>#include <iostream>#include <stdio.h>#include <algorithm>#include <cmath>#include <cstring>#include <string>#include <vector>#define ll long long#define PI原创 2020-08-31 23:24:54 · 431 阅读 · 1 评论 -
CCF 202006-4 1246
通过观察可以发现两位数的组合是有限的,所以两位数可以如同一位数一样写出dp方程: dp[i + 1][6] = dp[i][6] + dp[i][4]; dp[i + 1][4] = dp[i][2] + dp[i][6]; dp[i + 1][2] = dp[i][1]; dp[i + 1][1] = dp[i][4]; dp[i + 1][61] = dp[i][44]; dp[i + 1][62] = dp[i][41]; dp[i + 1][64] = dp[i][6]原创 2020-08-19 20:34:55 · 241 阅读 · 0 评论 -
CCF 201912-1 报数
#include <iostream>#include <stdio.h>using namespace std;int main() { int a[4] = { 0 }, t = 0, n, sum = 1, num = 1; cin >> n; while (sum <= n) { if (t == 4) t = 0; if (num % 7 == 0) a[t++]++; else if (num % 10 == 7 || num /原创 2020-08-21 16:16:16 · 100 阅读 · 0 评论 -
CCF 201912-2 回收站选址
#include <cstring>#include <string.h>#include <iostream>#include <stdio.h>#include <unordered_map>#include <map>#define ll long long#define PII pair<int, int>using namespace std;#define TLE ios::sync_with_原创 2020-08-21 16:52:43 · 123 阅读 · 0 评论 -
CCF 201912-3 化学方程式
#include <cstring>#include <string.h>#include <iostream>#include <stdio.h>#include <unordered_map>#include <map>#define ll long long#define PII pair<int, int>#define MSI map<string,int>#define TLE io原创 2020-08-23 16:52:37 · 151 阅读 · 0 评论 -
CCF 201909-1 小明种苹果
#include <cstring>#include <string.h>#include <iostream>#include <stdio.h>#define ll long long#define PII pair<int, int>#define MSI map<string,int>#define TLE ios::sync_with_stdio(0),cin.tie(0)#define mod 1000000原创 2020-08-28 18:07:45 · 100 阅读 · 0 评论 -
CCF 201909-2 小明种苹果(续)
#include <cstring>#include <string.h>#include <iostream>#include <stdio.h>#define ll long long#define PII pair<int, int>#define MSI map<string,int>#define TLE ios::sync_with_stdio(0),cin.tie(0)#define mod 1000000原创 2020-08-28 18:51:02 · 92 阅读 · 0 评论 -
CCF 201909-5 城市规划
#include<iostream>#include<algorithm>#include<string.h>#include<cstdio>using namespace std;const int maxn = 5e4 + 100;#define TLE ios::sync_with_stdio(0),cin.tie(0)const int INF = 0x3f3f3f3f;struct Node { int v, w, next;原创 2020-08-06 15:50:26 · 338 阅读 · 0 评论 -
CCF 201903-1 小中大
#include <cstring>#include <string.h>#include <iostream>#include <stdio.h>#include <algorithm>#include <cmath>#define ll long long#define PII pair<int, int>#define MSI map<string,int>#define TLE ios:原创 2020-08-28 21:10:29 · 101 阅读 · 0 评论 -
CCF 201903-2 二十四点
注意下Dev编译器 getline(cin,str) 识别问题 找了一下午错…#include <cstring>#include <string.h>#include <iostream>#include <stdio.h>#include <algorithm>#include <cmath>#include <cstring>#include <string>#include <ve原创 2020-09-02 22:26:39 · 95 阅读 · 0 评论 -
CCF 201609-1 最大波动
基础模拟,循环结构#include <stdio.h>#include <math.h>int main(){ int n, Fro, Nex, Del, Res = 0; scanf("%d%d", &n, &Fro); // 输入n,第一个数; while (--n) { scanf("%d", &Nex); // 循环输入第二至第n个数; Del = abs(Nex - Fro); // 保存原创 2020-08-20 17:42:03 · 111 阅读 · 0 评论 -
CCF 201609-2 火车购票
基础模拟,循环结构先判断是否可以连票 如果可以 依次输出结果后跳出如若不能连票(即flag == 0 && i循环到了末尾) 则插入式选座 从头开始遍历未占用的座位并逐个输出#include<stdio.h>int main() { int tic[105] = { 0 }, flag = 0; int temp = 0, n, p, i, j, t; scanf("%d", &n); for (t = 1; t <= n;原创 2020-08-20 17:42:46 · 75 阅读 · 0 评论 -
CCF 201604-1 折点计数
基础模拟,循环结构#include<stdio.h>int main() { int n,t1,t2,t3,res =0; scanf("%d%d%d", &n,&t1,&t2); for (int i = 0; i < n-2; i++) { scanf("%d", &t3); if ((t1 > t2 && t3 > t2) || (t1 < t2 &&原创 2020-08-20 17:35:45 · 106 阅读 · 0 评论 -
CCF 201604-2 俄罗斯方块
基础模拟,循环结构,二维数组计算板块1与地图1最早接触方块的下降距离,就是板块图案的最大下降距离用a数组保存地图,c数组保存板块中各点相对坐标,板块中方块的列坐标分别加上left-1为板块中方块在地图中的初始坐标,计算板块方块与地图方块相距最小的一列的上下两方快距离,即为板块整体下降距离(要注意边界,地图底部可能没有方块),得到后计算输出即可#include<stdio.h>int main() { int a[20][15] = { 0 }, c[4][2] = { 0 },原创 2020-08-20 17:36:41 · 146 阅读 · 0 评论 -
CCF 201312-1 出现次数最多的数
#include <cstring>#include <string.h>#include <iostream>#include <stdio.h>#include <unordered_map>#include <map>#define ll long longusing namespace std;map<int, int>mp;#define TLE ios::sync_with_stdio(0),c原创 2020-08-20 17:56:37 · 138 阅读 · 0 评论 -
CCF 201312-2 ISBN号码
#include <cstring>#include <string.h>#include <iostream>#include <stdio.h>#include <unordered_map>#include <map>#define ll long longusing namespace std;map<int, int>mp;#define TLE ios::sync_with_stdio(0),c原创 2020-08-20 18:15:41 · 99 阅读 · 0 评论 -
CCF 201312-3 最大的矩形
#include <cstring>#include <string.h>#include <iostream>#include <stdio.h>#include <unordered_map>#include <map>#define ll long longusing namespace std;#define TLE ios::sync_with_stdio(0),cin.tie(0)const int INF原创 2020-08-20 18:43:23 · 143 阅读 · 0 评论 -
CCF 201312-4 有趣的数
又又又又又又又又是dp解释一个应该就都懂了:dp[i + 1][5] = (dp[i][5] * 2 + dp[i][3] + dp[i][4]) % mod;含义为由2,0,1,3组成的i+1位数的组合可能性等于(由2,0,1,3组成的i位数末尾(即第i+1位)加上3或1,由2,0,1组成的i位数末尾(即第i+1位)加上3,由2,0,3组成的i位数末尾(即第i+1位)加上1)的三种状态之和 .#include <cstring>#include <string.h>#i原创 2020-08-20 21:48:32 · 117 阅读 · 0 评论