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:T674,#include using namespace std; typedef long long int ll; ll N; ll cap[100][100], flow[100][100], max_flow; int main() { cin>>N; for(ll i=1; i<=N; i++) { char uc, vc; ll u, v, c; cin>>uc>>vc>>c; if('a' <= uc && uc <= 'z') u = uc - 'a' + 26; else u = (ll)uc - 'A'; if('a' <= vc && vc <= 'z') v = vc - 'a' + 26; else v = (ll)vc - 'A'; cap[u][v] += c; cap[v][u] += c; } ll ck_debug = 2; while(ck_debug--) { queue q; ll par[60]; for(ll i=0; i<60; i++) par[i] = -1; par[0] = 0; q.push(0); ll ck = 0; for(ll i=1; i<52; i++) { if(cap[0][i] - flow[0][i] > 0) ck=1; } if(!ck) break; while(!q.empty()) { ll cur = q.front(); //cout<

제출 #126334

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력: