제출 #41179

#제출 시각아이디문제언어결과실행 시간메모리
41179DoanPhuDuc과수원 (NOI14_orchard)C++98
컴파일 에러
0 ms0 KiB
#include <bits/stdc++.h> #define FOR(x, a, b) for (int x = a; x <= b; ++x) #define FOD(x, a, b) for (int x = a; x >= b; --x) #define REP(x, a, b) for (int x = a; x < b; ++x) #define DEBUG(X) { cout << #X << " = " << X << endl; } #define PR(A, n) { cout << #A << " = "; FOR(_, 1, n) cout << A[_] << " "; cout << endl; } #define PR0(A, n) { cout << #A << " = "; REP(_, 0, n) cout << A[_] << " "; cout << endl; } using namespace std; typedef long long LL; typedef pair <int, int> II; const int INF = 0x3f3f3f3f; int n, m; int s[2][200][5000 + 10]; int main() { #ifdef LOCAL freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout); #endif // LOCAL scanf("%d%d\n", &n, &m); /* REP(i, 0, 2) { s[i].resize(n + 2, vector <int> (m + 2, 0)); }*/ /*int all = 0; FOR(i, 1, n) { FOR(j, 1, m) { char c = getchar(); int v = c - '0'; all += (v == 1); FOR(k, 0, 1) s[k][i][j] = s[k][i - 1][j]; s[v][i][j]++; } scanf("\n"); }*/ int ans = INF; /* FOR(i, 1, n) { FOR(j, i, n) { int prev = 0, sum = 0; FOR(k, 1, m) { int diff = (s[0][j][k] - s[0][i - 1][k]) - (s[1][j][k] - s[1][i - 1][k]); sum += diff; ans = min(ans, sum - prev); prev = max(prev, sum); } } }*/ // DEBUG(ans); cout << all + ans << endl; return 0; }

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

orchard.cpp: In function 'int main()':
orchard.cpp:54:13: error: 'all' was not declared in this scope
     cout << all + ans << endl;
             ^
orchard.cpp:26:28: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d\n", &n, &m);
                            ^