20200725 PAT甲级 7-2 The Judger (25分)

#include <iostream>
#include <vector>
#include <cmath>
using namespace std;int exist[100010]={0}, diff[100010] = {0};
// exist记录已经报过的数，diff记录已经报过的数的差值
vector<int> exists;
// exists记录已经报过的数，对于每个新报的数，和每个已存的数相减得差
int ht[15] = {0};
int a[1010][1010];int main() {int n1, n2;scanf("%d%d", &n1, &n2);diff[abs(n1 - n2)] = 1;exist[n1] = 1;exist[n2] = 1;exists.push_back(n1);exists.push_back(n2);int n, m;scanf("%d%d", &n, &m);for(int i = 1; i <= n; i++) for(int j = 1; j <= m; j++) scanf("%d", &a[i][j]); for(int j = 1; j <= m; j++) {for(int i = 1; i <= n; i++) {if(ht[i] == 1) continue;int t = a[i][j];if(diff[t] && !exist[t]) {for(int i = 0; i < exists.size(); i++) {int t2 = exists[i];diff[abs(t - t2)] = 1;}exist[t] = 1;exists.push_back(t);} else {ht[i] = 1;printf("Round #%d: %d is out.\n", j, i);}}}int f = 1;for(int i = 1; i <= n; i++) {if(ht[i] == 0) {if(f) printf("Winner(s):");printf(" %d", i);f = 0;}}if(f) printf("No winner.");return 0;
}

sad 考完补的其实就是理顺了考试时候的思路当时看到通过率才0.02还0.03就慌了觉得自己肯定不行orz（题目看懂却没写出来的估计就我一个白痴了……
测试样例过了，不知实际oj如何……

20200725 PAT甲级 7-2 The Judger (25分)相关推荐

PAT甲级1009 Product of Polynomials (25分)
PAT甲级1009 Product of Polynomials (25分) 题目: 题目分析:和之前有一道多项式相加很像,注意点是不仅仅数组系数会变,还可能会出现之前没有的指数,因此要开2001大小 ...
17冬第二题 PAT甲级 1141 Ranking of Institutions (25分) 有点鸡贼
题目 After each PAT, the PAT Center will announce the ranking of institutions based on their students' ...
PAT甲级 -- 1009 Product of Polynomials (25 分)
This time, you are supposed to find A×B where A and B are two polynomials. Input Specification: Each ...
PAT甲级-1021 Deepest Root（25分）
题目:1021 Deepest Root(25分) 分析:找出以某个节点为根时,最深的根,这题可能会超时要用vector来表示二维数组疑问:代码一是第二次写的超时了,代码二是第一次写的AC了,找不出 ...
PAT甲级--1007 Maximum Subsequence Sum (25 分)
题目详情 - 1007 Maximum Subsequence Sum (25 分) (pintia.cn) Given a sequence of K integers { N1, N2, .. ...
PAT甲级 -- 1007 Maximum Subsequence Sum (25 分)
Given a sequence of K integers { N1, N2, ..., NK }. A continuous subsequence is defined to ...
【PAT甲级】1037 Magic Coupon (25 分) C++ 全部AC
题目大意:给出两组数字,找出两组数字的最大乘积和. 思路:先排序,然后分别从头.从尾对应位置相乘,结果相加.直到相乘为负数为止. 题解 C++ #include<iostream> #i ...
【PAT甲级】1048 Find Coins (25 分) C++ 全部AC
题目给你一个sum,以及拥有的钱让你找出一个组合,正好用两张钱付清sum,注意如果有多个结果,输出其中最小的这道题注意稍微优化一下算法,要不然卡在测试点3,4 我是用二重循环过了的,只要注意输入 ...
【PAT甲级 - 1028】List Sorting (25分)（模拟，排序）
题干: Excel can sort records according to any column. Now you are supposed to imitate this function. I ...
【PAT - 甲级1024】Palindromic Number (25分)（大数，模拟）
题干: A number that will be the same when it is written forwards or backwards is known as a Palindromi ...

20200725 PAT甲级 7-2 The Judger (25分)

20200725 PAT甲级 7-2 The Judger (25分)相关推荐

最新文章

热门文章