Toggle navigation
Sky Online Judge
Problems
Challenges
Contest
Tools
Coder
Scoreboard
Code
Dev Message
Discuss
Make-A-Wish
LOGIN
上傳編號
193912
上傳時間
2024-02-15 17:17:14
題目
[APCS] 互補團隊 (201906)
使用者
anonymous
總得分
0,
Memory Limit Exceed
MLE
in 0 ms
#
State
Runtime
Memory
0
Memory Limit Exceed
MLE
0
1052672
1
Memory Limit Exceed
MLE
0
1052672
2
Memory Limit Exceed
MLE
0
1052672
3
Memory Limit Exceed
MLE
0
1052672
4
Memory Limit Exceed
MLE
0
1052672
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
#include <bits/stdc++.h>
using namespace std;
bool isGroup(vector<int> g1,vector<int> g2, int m){
set<int> s(g1.begin(),g1.end());
s.insert(g2.begin(),g2.end());
if(s.size()==m) return true;
return false;
}
int main(){
int m,n,cnt = 0;
string g;
cin >> m >> n;
vector<vector<int>> G(n,vector<int>());
vector<int> gg(n,1);
for(int i = 0; i < n; i++){
cin >> g;
set<int> s;
for(int j = 0; j < g.size(); j++){
s.insert(g[j]-'A');
}
G[i].assign(s.begin(),s.end());
}
for(int i = 0; i < n-1; i++){
while((gg[i]==0) && i < n-2) i++;
for(int j = i+1; j < n; j++){
while(gg[j]==0 && i < n-1) j++;
if(isGroup(G[i],G[j],m)){
cnt ++;
gg[i] = gg[j] = 0;
break;
}
}
}
cout << cnt << endl;
return 0;
}
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX