19:I[48803,["6079","static/chunks/363642f4-4672ca396f99db0d.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","5653","static/chunks/5653-e83dcf6c883f2fed.js","1394","static/chunks/1394-b96c40fff0826c8c.js","7412","static/chunks/7412-44bfc7df6d166700.js","9362","static/chunks/9362-6e86a7341ceee1cd.js","8720","static/chunks/8720-56867bcc82acef59.js","7881","static/chunks/7881-fa5bad7aa783c72e.js","3692","static/chunks/3692-317eca9943285a39.js","9211","static/chunks/9211-d3f977dbde988018.js","9791","static/chunks/app/submission/%5Bid%5D/page-52998aeb8359bb9f.js"],"CodeViewer"] 1b:I[48988,["6079","static/chunks/363642f4-4672ca396f99db0d.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","5653","static/chunks/5653-e83dcf6c883f2fed.js","1394","static/chunks/1394-b96c40fff0826c8c.js","7412","static/chunks/7412-44bfc7df6d166700.js","9362","static/chunks/9362-6e86a7341ceee1cd.js","8720","static/chunks/8720-56867bcc82acef59.js","7881","static/chunks/7881-fa5bad7aa783c72e.js","3692","static/chunks/3692-317eca9943285a39.js","9211","static/chunks/9211-d3f977dbde988018.js","9791","static/chunks/app/submission/%5Bid%5D/page-52998aeb8359bb9f.js"],"TestCaseDisplay"] 1a:T413,#include #include #include #include #include using namespace std; typedef long long l; typedef tuple t; bool check[305]; //cost , next pos; vector> graph[305]; vector>::iterator iter; priority_queue,greater> pq; int main(void) { l n,i,g,num,cost,result=0,count=0; ios::sync_with_stdio(0); cin.tie(0); cin >> n; check[n + 1] = 1; for (i = 1; i <= n; i++) { cin >> num; graph[n + 1].push_back({ num,i }); pq.push({ num,n + 1,i }); } for (i = 1; i <= n; i++) { for (g = 1; g <= n; g++) { cin >> num; if (i == g) continue; graph[i].push_back({ num,g }); } } while (count < n) { cost = get<0>(pq.top()); l n1 = get<1>(pq.top()); l n2 = get<2>(pq.top()); pq.pop(); if (check[n2] == 1) continue; check[n2] = 1

제출 #15909

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력: