QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#747499#9623. 合成大西瓜yeah14WA 4ms30540kbC++172.5kb2024-11-14 17:20:162024-11-14 17:20:16

Judging History

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

  • [2024-11-14 17:20:16]
  • 评测
  • 测评结果:WA
  • 用时:4ms
  • 内存:30540kb
  • [2024-11-14 17:20:16]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ull long long
#define PII  pair<int ,int>
const int INF = 0x3f3f3f3f3f3f3f;
const int mod = 1e9 + 7;
const int N = 1e6 + 5;
int fp(int a, int x, int mod) {
    int ans = 1;
    while (x) {
        if (x & 1)ans *= a;
        ans %= mod;
        a *= a;
        a %= mod;
        x >>= 1;
    }
    return ans;
}



//const int N = 1e6;
struct edge {
    int u, v;
};
struct node {
    int w;
    int id;
    bool operator<(const node& a)const {
        if (w != a.w)
            return w > a.w;
        else return id > a.id;
    }
};
int degree[N];
node a[N];
vector<int>e[N];
int top = 0;
int cnt = 0;
bool vis[N];

int dfs(int u) {
    int ans = a[u].w;
    int res = 0;
    int maxx = 0;
    for (int i = 0; i < e[u].size(); i++) {
        int v = e[u][i];
        if (vis[v])continue;
        vis[v] = 1;
        int k = dfs(v);
        if (k > maxx) {
            res = maxx;
            maxx = k;
        }
        else if (k > res) {
            res = k;
        }
        vis[v] = 0;
    }
    ans = max(res, ans);
    return ans;
}

void solve() {
    int n, m;
    cin >> n >> m;
    int k = n;
    int cnt = n;
    for (int i = 1; i <= n; i++) {
        cin >> a[i].w;
        
    }
    for (int i = 1; i <= m; i++) {
        int u, v;
        cin >> u >> v;
        /* e[u].push_back({ u,v });
         e[v].push_back({ v,u });*/
        e[u].push_back(v);
        e[v].push_back(u);
        degree[v]++;
        degree[u]++;
    }
    int st = 1;
    int ans = a[1].w;
    int maxx = a[1].w,mii=1;
    vector<int>maxxi;
    vector<int>resi;
    int res = 0,rii;
    for (int i = 1; i <= n; i++) {
        if (degree[i] >= 2&&ans<a[i].w) {
            st = i;
            ans = a[i].w;
        }
        if (maxx < a[i].w) {
            rii = mii;
            res = maxx;
            mii = i;
            maxx = a[i].w;

        }
        else if (a[i].w > res) {
            rii = i;
            res = a[i].w;
        }
    }
    for (int i = 1; i <= n; i++) {
        if (a[i].w == maxx)maxxi.push_back(i);
        if (a[i].w == res)resi.push_back(i);
    }
    if (maxxi.size() >= 2)ans = maxx;
    else ans = res;
    cout << res << endl;
}

signed main() {
   ios::sync_with_stdio(0);
   cin.tie(0), cout.tie(0);
    int t = 1;
    //cin >> t;
    while (t--) {
        solve();
    }
}
/*
 7 7
  1 1 2 3 1 2 1
  1 2
  2 3
  1 3
  2 4
  2 5
  5 6
  5 7
*/

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 4ms
memory: 30540kb

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:

6

result:

ok single line: '6'

Test #2:

score: -100
Wrong Answer
time: 3ms
memory: 30376kb

input:

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

output:

4

result:

wrong answer 1st lines differ - expected: '5', found: '4'