Submission #19803151
Source Code Expand
Copy
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
#include <bits/stdc++.h>
#define rep(i,x,y) for(int i=x;i<=y;++i)
#define per(i,x,y) for(int i=x;i>=y;--i)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int inf = 1e9;
const int mod=1e9+7;
const int N = 100 + 5;
int n,m,k;
int a[N],b[N];
int c[N],d[N],cnt[N];
int main() {
cin>>n>>m;
rep(i,1,m) cin>>a[i]>>b[i];
cin>>k;
rep(i,0,k-1){
cin>>c[i]>>d[i];
}
int ans=0;
rep(i,0,(1<<k)-1){
memset(cnt,0,sizeof cnt);
rep(j,0,k-1) if(i>>j&1){
cnt[c[j]]++;
}else cnt[d[j]]++;
int ret=0;
rep(i,1,m){
if(cnt[a[i]]&&cnt[b[i]]) ret++;
}
ans=max(ans,ret);
}
cout<<ans<<'\n';
return 0;
}
Submission Info
Submission Time
2021-01-30 12:45:17
Task
C - Bowls and Dishes
User
xyq0220
Language
C++ (GCC 9.2.1)
Score
300
Code Size
843 Byte
Status
AC
Exec Time
30 ms
Memory
3608 KB
Judge Result
Set Name
Sample
All
Score / Max Score
0 / 0
300 / 300
Status
Set Name
Test Cases
Sample
01_sample.txt, 02_sample.txt, 03_sample.txt
All
01_sample.txt, 02_sample.txt, 03_sample.txt, 04_small.txt, 05_small.txt, 06_small.txt, 07_small.txt, 08_small.txt, 09_small.txt, 10_small.txt, 11_small.txt, 12_small.txt, 13_large.txt, 14_large.txt, 15_large.txt, 16_large.txt, 17_large.txt, 18_large.txt, 19_large.txt, 20_large.txt, 21_large.txt, 22_max.txt, 23_max.txt, 24_max.txt, 25_max.txt, 26_max.txt, 27_max.txt, 28_max.txt, 29_max.txt, 30_max.txt, 31_max.txt, 32_max.txt, 33_max.txt, 34_max.txt, 35_star.txt, 36_star.txt, 37_star.txt, 38_star.txt
Case Name
Status
Exec Time
Memory
01_sample.txt
AC
8 ms
3440 KB
02_sample.txt
AC
2 ms
3576 KB
03_sample.txt
AC
3 ms
3372 KB
04_small.txt
AC
4 ms
3572 KB
05_small.txt
AC
2 ms
3492 KB
06_small.txt
AC
2 ms
3488 KB
07_small.txt
AC
2 ms
3420 KB
08_small.txt
AC
2 ms
3420 KB
09_small.txt
AC
2 ms
3492 KB
10_small.txt
AC
2 ms
3520 KB
11_small.txt
AC
2 ms
3424 KB
12_small.txt
AC
2 ms
3516 KB
13_large.txt
AC
14 ms
3492 KB
14_large.txt
AC
19 ms
3604 KB
15_large.txt
AC
4 ms
3608 KB
16_large.txt
AC
3 ms
3600 KB
17_large.txt
AC
3 ms
3392 KB
18_large.txt
AC
13 ms
3536 KB
19_large.txt
AC
6 ms
3604 KB
20_large.txt
AC
3 ms
3576 KB
21_large.txt
AC
2 ms
3488 KB
22_max.txt
AC
22 ms
3436 KB
23_max.txt
AC
22 ms
3600 KB
24_max.txt
AC
21 ms
3420 KB
25_max.txt
AC
18 ms
3600 KB
26_max.txt
AC
30 ms
3544 KB
27_max.txt
AC
20 ms
3376 KB
28_max.txt
AC
21 ms
3396 KB
29_max.txt
AC
18 ms
3440 KB
30_max.txt
AC
17 ms
3536 KB
31_max.txt
AC
18 ms
3572 KB
32_max.txt
AC
26 ms
3488 KB
33_max.txt
AC
18 ms
3448 KB
34_max.txt
AC
21 ms
3372 KB
35_star.txt
AC
22 ms
3580 KB
36_star.txt
AC
30 ms
3572 KB
37_star.txt
AC
29 ms
3576 KB
38_star.txt
AC
23 ms
3420 KB