QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#757533#9573. Social MediaEureka#WA 14ms5856kbC++141.3kb2024-11-17 09:40:542024-11-17 09:40:54

Judging History

你现在查看的是最新测评结果

  • [2024-11-17 09:40:54]
  • 评测
  • 测评结果:WA
  • 用时:14ms
  • 内存:5856kb
  • [2024-11-17 09:40:54]
  • 提交

answer

#include <bits/stdc++.h>
#define io ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define pb push_back
#define pii pair<int,int>
#define fi first
#define se second
#define N 210000
using namespace std;
typedef long long ll;

int v[N], a[N], n, m, k, ans, mx;
int l[N], r[N];
void work() {
    cin>>n>>m>>k;
    ans = 0; mx = 0;
    for(int i = 1;i <= k; i++)
        v[i] = a[i] = 0;
    map<pair<int, int>, int> p;
    for(int i = 1;i <= n; i++) {
        int x; cin>>x;
        v[x] = 1;
    }
    for(int i = 1; i <= m; i++) {
        cin>>l[i]>>r[i];
        if(v[l[i]] && v[r[i]]) ans++;
        else if(v[l[i]]) {
             ++a[r[i]];
        }
        else if(v[r[i]]) {
            ++a[l[i]];
        }
        else if(l[i] == r[i]) ++a[l[i]];
        else {
            if(l[i] > r[i]) swap(l[i], r[i]);
            ++p[{l[i], r[i]}];
        }
    }
    for(int i = 1; i <= m; i++) {
        if(v[l[i]] == 0 && v[r[i]] == 0) {
            mx = max(mx, p[{l[i], r[i]}] + a[l[i]] + a[r[i]]);
        }
    }
    sort(a + 1, a + k + 1);
    mx = max(mx, a[k] + a[k - 1]);


    cout<<ans + mx<<"\n";
}

signed main() {
    io;
    int t = 1;
    cin >> t;
    while (t--) {
        work();
    }
    return 0;
}

詳細信息

Test #1:

score: 100
Accepted
time: 1ms
memory: 3520kb

input:

5
4 12 7
5 7 3 6
3 6
2 2
1 4
2 4
1 3
7 6
4 1
5 4
1 1
1 1
2 1
3 7
2 7 6
2 4
1 2
3 2
2 5
5 4
2 6
4 6
2 6
1 1 2
1
1 2
2 1 2
1 2
1 2
2 1 100
24 11
11 24

output:

9
5
1
1
1

result:

ok 5 number(s): "9 5 1 1 1"

Test #2:

score: -100
Wrong Answer
time: 14ms
memory: 5856kb

input:

10000
19 12 20
8 12 1 5 11 7 17 13 19 6 3 9 10 15 14 20 4 18 16
4 11
7 1
8 4
16 19
1 13
15 2
16 2
8 7
3 15
11 13
5 20
18 14
17 14 20
2 9 1 12 8 11 10 17 18 16 3 15 5 14 20 13 7
15 10
3 2
5 16
7 8
6 1
6 4
18 16
1 8
4 1
20 6
6 9
4 15
7 5
14 9
1 3 18
9
15 18
17 15
11 14
7 19 7
3 1 2 5 6 4 7
5 1
4 5
3 1...

output:

12
14
1
19
7
5
1
11
19
4
3
10
6
2
4
19
15
2
18
4
17
5
1
2
5
17
3
2
6
15
6
3
6
4
4
7
3
7
4
1
19
15
2
4
6
12
12
7
6
8
8
6
8
11
16
1
4
9
8
14
2
6
19
19
16
8
20
14
8
12
7
9
6
8
2
17
9
5
5
3
6
6
20
8
13
11
10
5
3
7
3
1
8
5
8
11
7
14
10
9
9
11
7
9
5
2
8
14
10
5
3
5
5
10
1
6
10
16
5
3
19
1
4
8
8
10
4
2
1
1...

result:

wrong answer 5th numbers differ - expected: '6', found: '7'