제출 #496947

#제출 시각아이디문제언어결과실행 시간메모리
496947ergaganMaxcomp (info1cup18_maxcomp)C++17
0 / 100
1 ms332 KiB
//я так много думал, что опять попал #include <bits/stdc++.h> #define all(x) x.begin(),x.end() #define pb push_back #define ppb pop_back #define pf push_front #define ppf pop_front #define f first #define s second #define left(v) v + v #define right(v) v + v + 1 #define ub upper_bound #define lb lower_bound #pragma comment(linker, "/stack:200000000") #pragma GCC optimize("Ofast") #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native") using namespace std; typedef long long ll; //17 SEVENTEEN const long double Pi = acos(-1.0); const ll dx[] = {0,0,1,-1}; const ll dy[] = {1,-1,0,0}; const ll N = (ll) 1e6 + 17; const ll M = (ll) 5e3 + 69; const ll inf = (ll) 1e14 + 3; const ll mod = (ll) 1e9 + 7; ll sq(ll x) { return x * x; } ll zxc = 1, a[M][M]; void solve() { ll n, m, ans = -1, mx = -1, x, y; cin >> n >> m; for(ll i = 1; i <= n; i++) { for(ll j = 1; j <= m; j++) { cin >> a[i][j]; if(a[i][j] > mx) { mx = a[i][j]; x = i, y = j; } } } for(ll i = 1; i <= n; i++) { for(ll j = 1; j <= m; j++) { ans = max(ans, abs(a[i][j] - a[x][y]) - (abs(x - i) + abs(y - j) + 1)); } } cout << ans; } int main(/*Уверенно*/) { ios_base::sync_with_stdio(0); cin.tie(0); /* freopen(".in", "r", stdin); freopen(".out", "w", stdout); */ // cin >> zxc; while(zxc--) { solve(); } return 0; } // さよならさ いかなくちゃ

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

maxcomp.cpp:15: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
   15 | #pragma comment(linker, "/stack:200000000")
      | 
maxcomp.cpp: In function 'void solve()':
maxcomp.cpp:48:48: warning: 'y' may be used uninitialized in this function [-Wmaybe-uninitialized]
   48 |             ans = max(ans, abs(a[i][j] - a[x][y]) - (abs(x - i) + abs(y - j) + 1));
      |                                          ~~~~~~^
maxcomp.cpp:48:48: warning: 'x' may be used uninitialized in this function [-Wmaybe-uninitialized]
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...