oj.uz

답안 #202094

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
202094 2020-02-13T20:49:11 Z blacktulip Maxcomp (info1cup18_maxcomp) C++14
100 / 100
 187 ms 16760 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long lo;
typedef pair< lo,lo > PII;
typedef pair< lo,PII > PIII;
 
#define fi first
#define int long long
#define se second
#define mp make_pair
#define pb push_back
#define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define FOR for(int i=1;i<=n;i++)
#define mid ((start+end)/2)
#define ort ((bas+son)/2)
 
const lo MAX = -1000000000000000000;
const lo MIN = 1000000000000000000;
const lo inf = 100000000000000000;
const lo KOK = 100000;
const lo LOG = 30;
const lo li = 1005;
const lo mod = 1000000007;
 
int n,m,b[li],a[li][li],k,flag,t,mx[li];
int cev=-inf;
string s;
vector<PIII> v;
 
main(void){
	scanf("%lld %lld",&n,&m);
	for(int i=1;i<=m;i++)mx[i]=-inf;
	FOR{
		for(int j=1;j<=m;j++){
			scanf("%lld",&a[i][j]);
		}
	}
	FOR{
		int gel=0;
		for(int j=1;j<=m;j++){
			gel--;
			mx[j]--;
			mx[j]=max(mx[j],a[i][j]);
			gel=max(gel,mx[j]);
			cev=max(cev,abs(a[i][j]-gel));
		}
		gel=0;
		for(int j=m;j>=1;j--){
			gel--;
			//~ mx[j]--;
			mx[j]=max(mx[j],a[i][j]);
			gel=max(gel,mx[j]);
			cev=max(cev,abs(a[i][j]-gel));
		}
	}
	for(int i=1;i<=m;i++)mx[i]=-inf;
	for(int i=n;i>=1;i--){
		int gel=0;
		for(int j=1;j<=m;j++){
			gel--;
			mx[j]--;
			mx[j]=max(mx[j],a[i][j]);
			gel=max(gel,mx[j]);
			cev=max(cev,abs(a[i][j]-gel));
		}
		gel=0;
		for(int j=m;j>=1;j--){
			gel--;
			//~ mx[j]--;
			mx[j]=max(mx[j],a[i][j]);
			gel=max(gel,mx[j]);
			cev=max(cev,abs(a[i][j]-gel));
		}
	}
	printf("%lld\n",cev-1);
	return 0;
}

Compilation message

maxcomp.cpp:32:10: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main(void){
          ^
maxcomp.cpp: In function 'int main()':
maxcomp.cpp:33:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld %lld",&n,&m);
  ~~~~~^~~~~~~~~~~~~~~~~~~
maxcomp.cpp:37:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%lld",&a[i][j]);
    ~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 380 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 380 KB Output is correct
9 Correct 5 ms 504 KB Output is correct
10 Correct 5 ms 564 KB Output is correct
11 Correct 5 ms 632 KB Output is correct
12 Correct 5 ms 504 KB Output is correct
13 Correct 6 ms 632 KB Output is correct
14 Correct 5 ms 504 KB Output is correct

Subtask #4
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 380 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 5 ms 376 KB Output is correct
12 Correct 5 ms 504 KB Output is correct
13 Correct 5 ms 564 KB Output is correct
14 Correct 5 ms 632 KB Output is correct
15 Correct 5 ms 504 KB Output is correct
16 Correct 6 ms 632 KB Output is correct
17 Correct 5 ms 504 KB Output is correct
18 Correct 179 ms 8696 KB Output is correct
19 Correct 186 ms 16760 KB Output is correct
20 Correct 172 ms 8696 KB Output is correct
21 Correct 180 ms 8696 KB Output is correct
22 Correct 187 ms 8440 KB Output is correct
23 Correct 185 ms 8568 KB Output is correct
24 Correct 146 ms 8056 KB Output is correct