oj.uz

답안 #110674

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
110674 2019-05-11T21:50:14 Z Breno_XD Bitaro the Brave (JOI19_ho_t1) C++14
50 / 100
 206 ms 12796 KB 
#include <bits/stdc++.h>
using namespace std;

const int MAXN = 1100;
int N,M;
long long ans;
int matriz[MAXN][MAXN];
int row[MAXN][MAXN], r;
int column[MAXN][MAXN], c;
char letra;

int main(){

    //Leitura
    scanf("%d%d", &N, &M);
    for(int i=1; i<=N; i++){
        for(int j=1; j<=M; j++){
            cin >> letra;
            if(letra=='J') matriz[i][j]=-1;
            if(letra=='I') matriz[i][j]=1;
            if(letra=='O') column[i][j]+=++c;
            else column[i][j]=c;
        }
        c=0;
    }

    for(int i=1; i<=M; i++){
        for(int j=1; j<=N; j++){
            if(matriz[j][i]==1) row[j][i]+=++r;
            else row[j][i]=r;
        }
        r=0;
    }

    /*
    cout << endl;
    for(int i=1; i<=N; i++){
        for(int j=1; j<=M; j++){
            cout << matriz[i][j] << " ";
        }
        cout << endl;
    }
    cout << endl;

    cout << endl;
    for(int i=1; i<=N; i++){
        for(int j=1; j<=M; j++){
            cout << row[i][j] << " ";
        }
        cout << endl;
    }
    cout << endl;

    cout << endl;
    for(int i=1; i<=N; i++){
        for(int j=1; j<=M; j++){
            cout << column[i][j] << " ";
        }
        cout << endl;
    }
    cout << endl;
    */

    for(int i=1; i<=N; i++)
        for(int j=1; j<=M; j++)
            if(matriz[i][j]==-1) ans+= (column[i][M]-column[i][j])*(row[N][j]-row[i][j]);

    printf("%lld", ans);
    return 0;
}

Compilation message

joi2019_ho_t1.cpp: In function 'int main()':
joi2019_ho_t1.cpp:15:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d", &N, &M);
     ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 512 KB Output is correct
5 Correct 3 ms 1664 KB Output is correct
6 Correct 5 ms 1664 KB Output is correct
7 Correct 4 ms 1536 KB Output is correct
8 Correct 4 ms 1664 KB Output is correct
9 Correct 3 ms 1664 KB Output is correct
10 Correct 3 ms 1536 KB Output is correct
11 Correct 4 ms 1664 KB Output is correct
12 Correct 4 ms 1664 KB Output is correct
13 Correct 3 ms 1536 KB Output is correct

Subtask #2
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 512 KB Output is correct
5 Correct 3 ms 1664 KB Output is correct
6 Correct 5 ms 1664 KB Output is correct
7 Correct 4 ms 1536 KB Output is correct
8 Correct 4 ms 1664 KB Output is correct
9 Correct 3 ms 1664 KB Output is correct
10 Correct 3 ms 1536 KB Output is correct
11 Correct 4 ms 1664 KB Output is correct
12 Correct 4 ms 1664 KB Output is correct
13 Correct 3 ms 1536 KB Output is correct
14 Correct 26 ms 6776 KB Output is correct
15 Correct 6 ms 5476 KB Output is correct
16 Correct 14 ms 3676 KB Output is correct
17 Correct 2 ms 512 KB Output is correct
18 Correct 27 ms 6756 KB Output is correct
19 Correct 22 ms 7040 KB Output is correct
20 Correct 23 ms 6784 KB Output is correct
21 Correct 27 ms 6964 KB Output is correct
22 Correct 22 ms 6912 KB Output is correct
23 Correct 22 ms 6912 KB Output is correct
24 Correct 26 ms 7032 KB Output is correct
25 Correct 25 ms 6912 KB Output is correct
26 Correct 27 ms 6776 KB Output is correct

Subtask #3
0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 512 KB Output is correct
5 Correct 3 ms 1664 KB Output is correct
6 Correct 5 ms 1664 KB Output is correct
7 Correct 4 ms 1536 KB Output is correct
8 Correct 4 ms 1664 KB Output is correct
9 Correct 3 ms 1664 KB Output is correct
10 Correct 3 ms 1536 KB Output is correct
11 Correct 4 ms 1664 KB Output is correct
12 Correct 4 ms 1664 KB Output is correct
13 Correct 3 ms 1536 KB Output is correct
14 Correct 26 ms 6776 KB Output is correct
15 Correct 6 ms 5476 KB Output is correct
16 Correct 14 ms 3676 KB Output is correct
17 Correct 2 ms 512 KB Output is correct
18 Correct 27 ms 6756 KB Output is correct
19 Correct 22 ms 7040 KB Output is correct
20 Correct 23 ms 6784 KB Output is correct
21 Correct 27 ms 6964 KB Output is correct
22 Correct 22 ms 6912 KB Output is correct
23 Correct 22 ms 6912 KB Output is correct
24 Correct 26 ms 7032 KB Output is correct
25 Correct 25 ms 6912 KB Output is correct
26 Correct 27 ms 6776 KB Output is correct
27 Incorrect 206 ms 12796 KB Output isn't correct
28 Halted 0 ms 0 KB -