제출 #250679

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
250679		kingfran1907	Bob (COCI14_bob)	C++14	0 / 120	173 ms	8260 KiB

bob

#include <bits/stdc++.h>

using namespace std;
typedef long long llint;

const int maxn = 1010;

int n, m;
int niz[maxn][maxn];
int cn[maxn][maxn];
vector< int > v;
int sol[maxn];
stack< llint > p, q;

llint cal() {
    while (!q.empty()) {q.pop(); p.pop();}
    llint out = 0;

    llint tren = 0;
    for (int i = 0; i < v.size(); i++) {
        llint cnt = 1;
        while (!p.empty() && p.top() >= v[i]) {
            llint ac = q.top(); q.pop();
            llint val = p.top(); p.top();

            cnt += ac;
            tren -= ac * (val - v[i]);
        }
        tren += v[i];
        out += tren;
    }
    v.clear();
    return out;
}

int main() {
    scanf("%d%d", &n, &m);
    for (int i = 0; i < n; i++)
        for (int j = 0; j < m; j++)
            scanf("%d", &niz[i][j]);

    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            if (i == 0) cn[i][j] = 1;
            else {
                if (niz[i][j] == niz[i - 1][j]) cn[i][j] = 1 + cn[i - 1][j];
                else cn[i][j] = 1;
            }
        }
    }

    llint sol = 0;
    for (int i = 0; i < n; i++) {
        v.push_back(cn[i][0]);
        for (int j = 1; j < m; j++) {
            if (niz[i][j - 1] != niz[i][j]) sol += cal();
            v.push_back(cn[i][j]);
        }
        sol += cal();
    }
    printf("%lld", sol);
    return 0;
}

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

bob.cpp: In function 'llint cal()':
bob.cpp:20:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < v.size(); i++) {
                     ~~^~~~~~~~~~
bob.cpp: In function 'int main()':
bob.cpp:37:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d", &n, &m);
     ~~~~~^~~~~~~~~~~~~~~~
bob.cpp:40:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
             scanf("%d", &niz[i][j]);
             ~~~~~^~~~~~~~~~~~~~~~~~

• Subtask 1: 0 / 12
• Subtask 2: 0 / 12
• Subtask 3: 0 / 12
• Subtask 4: 0 / 12
• Subtask 5: 0 / 12
• Subtask 6: 0 / 12
• Subtask 7: 0 / 12
• Subtask 8: 0 / 12
• Subtask 9: 0 / 12
• Subtask 10: 0 / 12