제출 #1101877

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1101877		KasymK	Bitaro the Brave (JOI19_ho_t1)	C++17	20 / 100	11 ms	2812 KiB

joi2019_ho_t1

#include "bits/stdc++.h"
using namespace std;
#define ff first
#define ss second
#define all(v) v.begin(), v.end()
#define ll long long
#define pb push_back
#define pii pair<int, int>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define tr(i, c) for(auto i = c.begin(); i != c.end(); ++i)
#define wr puts("----------------")
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
const int N = 3005;
char c[N][N];
int sm[N], sm1[N];

int main(){
    int n, m;
    ll answer = 0;
    scanf("%d%d", &n, &m);
    for(int i = 1; i <= n; ++i)
        for(int j = 1; j <= m; ++j)
            scanf(" %c", &c[i][j]), sm[i] += (c[i][j]=='O'?1:0), sm1[j] += (c[i][j]=='I'?1:0);
    for(int i = 1; i <= n; ++i)
        for(int j = 1; j <= m; ++j){
            if(c[i][j] == 'J')
                answer += sm[i]*sm1[j];
            else if(c[i][j] == 'O')
                sm[i]--;
            else
                sm1[j]--;
        }
    printf("%d\n", answer);
    return 0;
}

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

joi2019_ho_t1.cpp: In function 'int main()':
joi2019_ho_t1.cpp:35:14: warning: format '%d' expects argument of type 'int', but argument 2 has type 'long long int' [-Wformat=]
   35 |     printf("%d\n", answer);
      |             ~^     ~~~~~~
      |              |     |
      |              int   long long int
      |             %lld
joi2019_ho_t1.cpp:22:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   22 |     scanf("%d%d", &n, &m);
      |     ~~~~~^~~~~~~~~~~~~~~~
joi2019_ho_t1.cpp:25:18: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   25 |             scanf(" %c", &c[i][j]), sm[i] += (c[i][j]=='O'?1:0), sm1[j] += (c[i][j]=='I'?1:0);
      |             ~~~~~^~~~~~~~~~~~~~~~~

• Subtask 1: 20 / 20
• Subtask 2: 0 / 30
• Subtask 3: 0 / 50