# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
980120 | 2024-05-11T23:53:52 Z | FZ_Melo | 봉쇄 시간 (IOI23_closing) | C++17 | 76 ms | 20564 KB |
#include "closing.h" #include <bits/stdc++.h> #include <vector> #include <queue> using namespace std; struct ari{ int node; long long w; }; struct tpos{ int node; long long cnt; }; bool operator <(const tpos &a, const tpos &b){ return a.cnt>b.cnt; } int n; long long k; long long cnt; int ans; vector<vector<ari>> adj; priority_queue<tpos> q; void dfs(){ tpos t, ta; while(!q.empty() && cnt<k){ t=q.top(); q.pop(); if(cnt+t.cnt<=k) cnt+=t.cnt; else break; ans++; for(auto h: adj[t.node]){ q.push({h.node, t.cnt+h.w}); } } } int max_score(int N, int X, int Y, long long K, std::vector<int> U, std::vector<int> V, std::vector<int> W) { n=N; k=K; ans=2; adj.resize(n); for(int i=0; i<n-1; i++){ adj[U[i]].push_back({V[i], W[i]}); adj[V[i]].push_back({U[i], W[i]}); } for(int i=0; i<adj[X].size(); i++){ q.push({adj[X][i].node, adj[X][i].w}); } for(int i=0; i<adj[X].size(); i++){ q.push({adj[X][i].node, adj[X][i].w}); } dfs(); return ans; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 348 KB | 2nd lines differ - on the 1st token, expected: '3', found: '6' |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 76 ms | 20564 KB | 1st lines differ - on the 1st token, expected: '451', found: '11186' |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Incorrect | 1 ms | 348 KB | 1st lines differ - on the 1st token, expected: '30', found: '31' |
3 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Incorrect | 1 ms | 348 KB | 1st lines differ - on the 1st token, expected: '30', found: '31' |
3 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Incorrect | 1 ms | 348 KB | 1st lines differ - on the 1st token, expected: '30', found: '31' |
3 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 348 KB | 2nd lines differ - on the 1st token, expected: '3', found: '6' |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 348 KB | 2nd lines differ - on the 1st token, expected: '3', found: '6' |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 348 KB | 2nd lines differ - on the 1st token, expected: '3', found: '6' |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 348 KB | 2nd lines differ - on the 1st token, expected: '3', found: '6' |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 348 KB | 2nd lines differ - on the 1st token, expected: '3', found: '6' |
2 | Halted | 0 ms | 0 KB | - |