QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#739152	#9623. 合成大西瓜	Rosmontispes^#	WA	0ms	3844kb	C++20	1.1kb	2024-11-12 21:01:39	2024-11-12 21:01:46

Judging History

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

[2024-11-12 21:01:46]
评测

测评结果：WA
用时：0ms
内存：3844kb

查看

[2024-11-12 21:01:39]
提交

answer

#include<bits/stdc++.h>
using namespace std;

void solve()
{
    int n,m;
    cin>>n>>m;
    vector<int>ar(n + 1),du(n + 1);
    vector<vector<int>>adj(n + 1);
    for(int i = 1;i <= n;i ++)
        cin>>ar[i];
    for(int i = 1;i <= m;i ++){
        int u,v;
        cin>>u>>v;
        adj[u].push_back(v);
        adj[v].push_back(u);
        du[u] ++,du[v] ++;
    }
    if(n == 1){
        cout<<ar[1]<<"\n";
        return;
    }
    int mx = 0;
    for(int i = 1;i <= n;i ++)
        if(du[i] >= 2)
            mx = max(mx,ar[i]);
    for(int i = 1;i <= n;i ++){
        vector<int>tmp;
        for(auto v:adj[i])
            if(du[v] == 1)
                tmp.push_back(ar[v]);
        sort(tmp.begin(),tmp.end(),[&](int x,int y){
            return x > y;
        });
        if(tmp.size() >= 2){
            mx = max(mx,min(tmp[0],tmp[1]));
        }
    }
    cout<<mx<<"\n";
}

signed main()
{
    ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    // int T;
    // cin>>T;
    // while(T --)
        solve();
}

源文件, 语言: C++20

详细

Test #1:

score: 100

Accepted

time: 0ms

memory: 3500kb

input:

7 9
1 4 1 3 3 6 7
5 4
3 6
3 4
2 3
5 2
2 6
6 7
5 1
4 6

output:

result:

ok single line: '6'

Test #2:

score: 0

Accepted

time: 0ms

memory: 3776kb

input:

output:

result:

ok single line: '5'

Test #3:

score: 0

Accepted

time: 0ms

memory: 3624kb

input:

7 7
2 4 2 3 3 6 7
5 1
2 6
5 3
4 6
1 6
1 2
2 7

output:

result:

ok single line: '6'

Test #4:

score: 0

Accepted

time: 0ms

memory: 3496kb

input:

output:

result:

ok single line: '2'

Test #5:

score: 0

Accepted

time: 0ms

memory: 3560kb

input:

output:

result:

ok single line: '5'

Test #6:

score: 0

Accepted

time: 0ms

memory: 3816kb

input:

7 9
3 2 3 5 2 6 7
7 4
5 4
5 6
1 7
1 6
2 3
7 6
6 4
4 2

output:

result:

ok single line: '7'

Test #7:

score: 0

Accepted

time: 0ms

memory: 3564kb

input:

output:

result:

ok single line: '2'

Test #8:

score: 0

Accepted

time: 0ms

memory: 3544kb

input:

9 9
6 1 1 1 3 7 1 8 9
9 8
6 7
2 7
5 6
7 9
5 1
7 3
1 6
1 4

output:

result:

ok single line: '9'

Test #9:

score: 0

Accepted

time: 0ms

memory: 3560kb

input:

9 10
7 7 4 2 2 6 6 8 9
9 6
4 6
1 2
4 3
5 6
7 5
6 8
7 4
1 7
1 9

output:

result:

ok single line: '9'

Test #10:

score: 0

Accepted

time: 0ms

memory: 3844kb

input:

output:

result:

ok single line: '3'

Test #11:

score: 0

Accepted

time: 0ms

memory: 3564kb

input:

7 7
4 4 5 1 1 6 7
2 1
1 7
5 4
2 4
1 3
5 6
7 4

output:

result:

ok single line: '7'

Test #12:

score: -100

Wrong Answer

time: 0ms

memory: 3564kb

input:

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

output:

result:

wrong answer 1st lines differ - expected: '16', found: '13'