oj.uz

답안 #150976

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
150976 2019-09-01T13:32:01 Z PedroBigMan Strah (COCI18_strah) C++14
55 / 110
 1000 ms 67296 KB 
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <string>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
#define REP(i,a,b) for(ll i=a; i<b; i++)
#define pb push_back
#define mp make_pair
#define pl pair<ll,ll>
#define ff first
#define ss second
#define INF ((ll) pow(2,63) -1)
ll insig;
#define In(vecBRO, LENBRO) REP(IBRO,0,LENBRO) {cin>>insig; vecBRO.pb(insig);}
void Out(vector<ll> x) {REP(i,0,x.size()) {cout<<x[i]<<" ";} cout<<endl;}

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    ll N,M; cin>>N>>M; ll a[N][M]; char cur;
    REP(i,0,N) {REP(j,0,M) {cin>>cur; if(cur=='.') {a[i][j]=1;} else {a[i][j]=0;};}}
    ll ans=0; ll curh;
    REP(i,0,N)
    {
        vector<ll> h;
        REP(j,0,M)
        {
            curh=0;
            while(curh<=i && a[i-curh][j]==1) {curh++;}
            h.pb(curh);
        }
        vector<vector<ll> > ME; vector<ll> xx; ll m;
        REP(j,0,M) 
        {
            xx.clear();
            REP(z,0,j) {xx.pb(-1);}
            m=INF;
            REP(z,j,M) {m=min(m,h[z]); xx.pb(m);}
            ME.pb(xx);
        }
        REP(x1,0,M)
        {
            REP(x2,x1,M)
            {
                ans+=(x2-x1+1)*(ME[x1][x2]+1)*(ME[x1][x2]);
            }
        }
    }
    cout<<ans/2<<endl;
    return 0;
}

Compilation message

strah.cpp: In function 'void Out(std::vector<long long int>)':
strah.cpp:10:33: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define REP(i,a,b) for(ll i=a; i<b; i++)
strah.cpp:19:29:
 void Out(vector<ll> x) {REP(i,0,x.size()) {cout<<x[i]<<" ";} cout<<endl;}
                             ~~~~~~~~~~~~
strah.cpp:19:25: note: in expansion of macro 'REP'
 void Out(vector<ll> x) {REP(i,0,x.size()) {cout<<x[i]<<" ";} cout<<endl;}
                         ^~~

Subtask #1
11.0 / 11.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 223 ms 2084 KB Output is correct
2 Correct 263 ms 2004 KB Output is correct

Subtask #4
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 225 ms 1972 KB Output is correct
2 Correct 226 ms 2012 KB Output is correct

Subtask #5
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 245 ms 2092 KB Output is correct
2 Correct 226 ms 2040 KB Output is correct

Subtask #6
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1072 ms 22096 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #7
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1046 ms 49296 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #8
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1059 ms 40608 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #9
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 249 ms 3108 KB Output is correct
2 Execution timed out 1042 ms 45660 KB Time limit exceeded

Subtask #10
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1086 ms 67296 KB Time limit exceeded
2 Halted 0 ms 0 KB -