제출 #430885

#제출 시각아이디문제언어결과실행 시간메모리
430885HideoIOI 바이러스 (JOI21_fever)C++17
0 / 100
1 ms296 KiB
#include <bits/stdc++.h> using namespace std; #define all(s) s.begin(), s.end() #define ll long long #define fr first #define sc second #define pb push_back #define mk make_pair #define pi pair < int, int > const int N = 3007; const int INF = 1e9 + 7; pi d[4] = {{1, 0}, {-1, 0}, {0, -1}, {0, 1}}; int x[N], y[N]; int us[N]; int n, ans; int check (int v, int u, int k){ if (abs(x[v] - x[u]) != abs(y[v] - y[u])){ if (x[v] == x[u]){ } else if (y[v] == y[u]){ } return -1; } if (k == 0){ if (x[u] < x[v]) return -1; if (y[u] > y[v]) return 2; else return 3; } if (k == 1){ if (x[u] > x[v]) return -1; if (y[u] > y[v]) return 2; else return 3; } if (k == 2){ if (y[u] > y[v]) return -1; if (x[u] > x[v]) return 1; else return 0; } if (k == 3){ if (y[u] < y[v]) return -1; if (x[u] > x[v]) return 1; else return 0; } } int solve (int v, int k){ us[v] = 1; int r = 1; for (int i = 1; i <= n; i++){ if (us[i]) continue; int nk = check(v, i, k); if (nk != -1){ r += solve(i, nk); } } return r; } main (){ cin >> n; for (int i = 1; i <= n; i++){ cin >> x[i] >> y[i]; } ans = max(ans, solve(1, 0)); memset(us, 0, sizeof(us)); ans = max(ans, solve(1, 1)); memset(us, 0, sizeof(us)); ans = max(ans, solve(1, 2)); memset(us, 0, sizeof(us)); ans = max(ans, solve(1, 3)); cout << ans; }

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

fever.cpp:79:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   79 | main (){
      | ^~~~
fever.cpp: In function 'int check(int, int, int)':
fever.cpp:63:1: warning: control reaches end of non-void function [-Wreturn-type]
   63 | }
      | ^
#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...