oj.uz

답안 #89593

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
89593 2018-12-16T20:47:16 Z jasony123123 Bob (COCI14_bob) C++11
120 / 120
 287 ms 34592 KB 
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
//#include <ext/pb_ds/tree_policy.hpp>
//#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
//using namespace __gnu_pbds;
#define FOR(i,start,end) for(int i=start;i<(int)(end);i++)
#define FORE(i,start,end) for(int i=start;i<=(int)end;i++)
#define RFOR(i,start,end) for(int i = start; i>end; i--)
#define RFORE(i,start,end) for(int i = start; i>=end; i--)
#define all(a) a.begin(), a.end()
#define mt make_tuple
#define v vector
#define sf scanf
#define pf printf
#define dvar(x) cout << #x << " := " << x << "\n"
#define darr(x,n) FOR(i,0,n) cout << #x << "[" << i << "]" << " := " << x[i] << "\n"
typedef long long ll;
typedef long double ld;
typedef pair<int, int > pii;
typedef pair<ll, ll> pll;
//template <class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<class T> void minn(T &a, T b) { a = min(a, b); }
template<class T> void maxx(T &a, T b) { a = max(a, b); }
void io() {
#ifdef LOCAL_PROJECT 
	freopen("input.in", "r", stdin); freopen("output.out", "w", stdout);
#else 
//	freopen("X.in", "r", stdin); freopen("X.out", "w", stdout);
#endif 
//	ios_base::sync_with_stdio(false); cin.tie(NULL);
}
const ll MOD = 1000000007LL;
const ll PRIME = 105943LL;
const ll INF = 1e18;
/****************************************************************/

int N, M, E[1001][1001], down[1000];

ll solve(int x, int y) {
	priority_queue<int> pq;
	ll cursum = 0;
	ll anssum = 0;

	RFORE(i, y, x) {
		while (!pq.empty() && pq.top() > down[i]) {
			int num = pq.top();
			pq.pop();
			cursum -= num;
			pq.push(down[i]);
			cursum += down[i];
		}
		pq.push(down[i]);
		cursum += down[i];
		anssum += cursum;
	}
	return anssum;
}
int main() {
	io();
	sf("%d%d", &N, &M);
	FOR(i, 0, N) FOR(j, 0, M) sf("%d", &E[i][j]);
	ll ans = 0;
	RFORE(r, N - 1, 0) {
		FOR(c, 0, M) {
			if (E[r][c] == E[r + 1][c])
				down[c]++;
			else
				down[c] = 1;
		}
		for (int i = 0; i < M; i++) {
			int j = i;
			while (j + 1 < M && E[r][i] == E[r][j + 1])
				j++;
			ans += solve(i, j);
			i = j;
		}
	}
	cout << ans << "\n";
	return 0;
}

Compilation message

bob.cpp: In function 'int main()':
bob.cpp:61:4: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  sf("%d%d", &N, &M);
    ^
bob.cpp:62:30: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  FOR(i, 0, N) FOR(j, 0, M) sf("%d", &E[i][j]);
                              ^

Subtask #1
12.0 / 12.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 49 ms 3032 KB Output is correct

Subtask #4
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 64 ms 4020 KB Output is correct

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 48 ms 5192 KB Output is correct

Subtask #6
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 51 ms 6436 KB Output is correct

Subtask #7
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 276 ms 15020 KB Output is correct
2 Correct 228 ms 17012 KB Output is correct
3 Correct 97 ms 18888 KB Output is correct

Subtask #8
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 233 ms 23052 KB Output is correct
2 Correct 195 ms 24836 KB Output is correct
3 Correct 99 ms 26788 KB Output is correct

Subtask #9
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 224 ms 26892 KB Output is correct
2 Correct 96 ms 28736 KB Output is correct
3 Correct 102 ms 30688 KB Output is correct

Subtask #10
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 265 ms 30840 KB Output is correct
2 Correct 287 ms 32712 KB Output is correct
3 Correct 97 ms 34592 KB Output is correct