제출 #1088815

#제출 시각아이디문제언어결과실행 시간메모리
1088815BismillahUntitled (POI11_kon)C++17
0 / 100
3094 ms107520 KiB
#include <bits/stdc++.h> using namespace std; #define all(v) v.begin(), v.end() typedef long long ll; const int NMAX = 1e5 + 5; int n, deg[NMAX], cnt[NMAX], ans, x, a, b; int main(void){ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n; for(int i = 0; i < n; i++){ cin >> deg[i]; cnt[deg[i]]++; b += deg[i]; for(int j = 0; j < deg[i]; j++) cin >> x; } sort(deg, deg + n); x = 0; for(int i = n - 1; i; i--){ a += deg[i]; b -= deg[i]; x++; if(a - b == x * (x - 1)){ if (ans) while(1); if(deg[i] == deg[i - 1]) ans += cnt[deg[i]]; else ans++; } } cout << ans; return 0; }

컴파일 시 표준 에러 (stderr) 메시지

kon.cpp: In function 'int main()':
kon.cpp:23:20: warning: this 'while' clause does not guard... [-Wmisleading-indentation]
   23 |           if (ans) while(1);
      |                    ^~~~~
kon.cpp:24:13: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'while'
   24 |             if(deg[i] == deg[i - 1]) ans += cnt[deg[i]];
      |             ^~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...