1a:I[48803,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","8501","static/chunks/8501-12247bfa9b4a3a0d.js","7961","static/chunks/7961-b9b64ba388cef309.js","3729","static/chunks/3729-8164898f6bdc738c.js","8720","static/chunks/8720-56867bcc82acef59.js","8324","static/chunks/8324-1983729ec379e9d8.js","9211","static/chunks/9211-c08bacb1ba75336f.js","9791","static/chunks/app/submission/%5Bid%5D/page-abe92e013e824763.js"],"CodeViewer"] 1c:I[48988,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","8501","static/chunks/8501-12247bfa9b4a3a0d.js","7961","static/chunks/7961-b9b64ba388cef309.js","3729","static/chunks/3729-8164898f6bdc738c.js","8720","static/chunks/8720-56867bcc82acef59.js","8324","static/chunks/8324-1983729ec379e9d8.js","9211","static/chunks/9211-c08bacb1ba75336f.js","9791","static/chunks/app/submission/%5Bid%5D/page-abe92e013e824763.js"],"TestCaseDisplay"] 1b:T5bd,#include #include #define GraphD std::vector> struct BufferType{ int X, T; bool operator() (BufferType& A, BufferType& B){ return A.T > B.T; } }; int posSort(GraphD&, int, std::vector&, std::vector&); int main(int argc, char* argv[]){ int T; scanf("%d", &T); while(T--){ int N, M, E; scanf("%d %d", &N, &M); GraphD graph(N); std::vector ST(N); std::vector indegree(N, 0); for(int i = 0; i < N; i++){ scanf("%d", &ST[i]); } for(int i = 0; i < M; i++){ int x, y; scanf("%d %d", &x, &y); x--; y--; indegree[y]++; graph[x].emplace_back(y); } scanf("%d", &E); E--; printf("%d\n", posSort(graph, E, indegree, ST)); } return 0; } int posSort(GraphD& graph, int T, std::vector& id, std::vector& ST){ int N = id.size(); std::priority_queue

제출 #134376

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력: