PAT A1121 Damn Single
Sample Input:
3
11111 22222
33333 44444
55555 66666
7
55555 44444 10000 88888 22222 11111 23333
Sample Output:
5
10000 23333 44444 55555 88888
word | meaning |
---|---|
dangling with |
- 思路 1:同 A1149Dangerous Goods Packaging
- 输入时建立每对couple的map表
- 输入查询数组时,如果当前元素有对象,将他对象标记,输入结束后,所有被标记的都是不应该出现在派对的(没有被标记的有两种情况:1.没对象 2.他对象没来(若来了就会标记上他))
- 再遍历一遍,将所有没被标记的(单身狗),insert到set(自动有序)中,输出即可
-
TIPS 1:看到固定位数ID的题:别忘了格式化输出!!!
-
code 1:
#include <iostream>
#include <unordered_map>
//#include <vector>
#include <set>
#include <algorithm>
using namespace std;
const int maxn = 100010;
bool mark[maxn];
int input[maxn];
set<int> ans;
unordered_map<int, int> mp;
int main(){
int n, nq, a, b;
scanf("%d", &n);
for(int i = 0; i < n; ++i){
scanf("%d %d", &a, &b);
mp[a] = b;
mp[b] = a;
}
scanf("%d", &nq);
for(int i = 0; i < nq; ++i){
scanf("%d", &input[i]);
if(mp.find(input[i]) != mp.end()) //如果有对象就标记出上的对象
mark[mp[input[i]]] = true;
}
for(int i = 0; i < nq; ++i){
if(mark[input[i]] == false){ //没有被标记的有两种情况:1.没对象 2.他对象没来(若来了就会标记上他)
ans.insert(input[i]);
}
}
printf("%d\n", ans.size());
for(auto it = ans.begin(); it != ans.end(); ++it)
if(it == ans.begin()) printf("%05d", *it); //!!!Wrong 1:遇到固定位数的ID,别忘了格式化输出
else printf(" %05d", *it);
return 0;
}
- T2 code:
#include <bits/stdc++.h>
using namespace std;
unordered_map<int, int> mp;
unordered_map<int, bool> has;
set<int> attend;
int main(){
int n;
scanf("%d", &n);
for(int i = 0; i < n; ++i){
int p1, p2;
scanf("%d %d", &p1, &p2);
mp[p1] = p2;
mp[p2] = p1;
}
scanf("%d", &n);
for(int i = 0; i < n; ++i){
int guest;
scanf("%d", &guest);
if(mp.find(guest) == mp.end()){
attend.insert(guest);
}else{
if(has[guest] == false){
attend.insert(guest);
has[mp[guest]] = true;
}else{
attend.erase(mp[guest]);
}
}
}
printf("%d\n", attend.size());
for(auto it = attend.begin(); it != attend.end(); ++it){
if(it == attend.begin()) printf("%05d", *it);
else printf(" %05d", *it);
}
return 0;
}
-
思路 2:
改用vector存储结果,使用sort+Cpp内置比较函数来排序 -
code 2:
#include <iostream>
#include <unordered_map>
#include <vector>
#include <algorithm>
using namespace std;
const int maxn = 100010;
bool mark[maxn];
int input[maxn];
vector<int> ans;
unordered_map<int, int> mp;
int main(){
int n, nq, a, b;
scanf("%d", &n);
for(int i = 0; i < n; ++i){
scanf("%d %d", &a, &b);
mp[a] = b;
mp[b] = a;
}
scanf("%d", &nq);
for(int i = 0; i < nq; ++i){
scanf("%d", &input[i]);
if(mp.find(input[i]) != mp.end())
mark[mp[input[i]]] = true;
}
for(int i = 0; i < nq; ++i){
if(mark[input[i]] == false){
ans.push_back(input[i]);
}
}
sort(ans.begin(), ans.end(), less<int>()); //TIPS 1:C++内置比较函数,节省时间
printf("%d\n", ans.size());
for(int i = 0; i < ans.size(); ++i)
if(i == 0) printf("%05d", ans[i]);
else printf(" %05d", ans[i]);
return 0;
}
- TIPS 1:C++比较函数:
less<type>(); //<
greater<type>(); //>
less_equal<type>(); //<=
greater_equal<type>(); //>=