oj.uz

답안 #876617

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
876617 2023-11-22T05:43:22 Z hasan2006 Bitaro the Brave (JOI19_ho_t1) C++17
100 / 100
 133 ms 79988 KB 
#include <bits/stdc++.h>

using namespace std;

#define TL ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define rall(s) s.rbegin(),s.rend()
#define all(s) s.begin(),s.end()
#define pb push_back
#define se second
#define fi first
#define ll long long
#define ld long double
#define YES cout<<"YES\n"
#define Yes cout<<"Yes\n"
#define yes cout<<"yes\n"
#define NO cout<<"NO\n"
#define No cout<<"No\n"
#define no cout<<"no\n"


const int N = 3e3 + 9 , mod = 1e9 + 7;
ll   a[N][N] = {}, b[N] , c[N][3] , d[N];

void solve()
{
    ll q , i , j , m ,n, z ,s = 0 , f, l , r , k , x , y , mn  = 1e18 , mx = 0;
    cin>>n>>m;
    d['J'] = 0;
    d['O'] = 1;
    d['I'] = 2;
    for(i = 1; i <= n; i++){
        for(j = 1; j <= m; j++){
            char ch;
            cin>>ch;
            a[i][j] = d[ch];
            c[i][1] += (a[i][j] == 1);
            c[j][2] += (a[i][j] == 2);
        }
    }
    for(i = 1; i <= n; i++){
        for(j = 1; j <= m; j++){
            c[j][2] -= (a[i][j] == 2);
            c[i][1] -= (a[i][j] == 1);
            if(a[i][j] == 0)
                s += c[i][1] * c[j][2];
        }
    }
    cout<<s<<"\n";
}

int main(){
    TL;

  /*
    #ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
    #endif*/
int t = 1;
//cin>>t;
while(t--)
     {
     solve();
     }
}
// Author : حسن

Compilation message

joi2019_ho_t1.cpp: In function 'void solve()':
joi2019_ho_t1.cpp:35:25: warning: array subscript has type 'char' [-Wchar-subscripts]
   35 |             a[i][j] = d[ch];
      |                         ^~
joi2019_ho_t1.cpp:26:8: warning: unused variable 'q' [-Wunused-variable]
   26 |     ll q , i , j , m ,n, z ,s = 0 , f, l , r , k , x , y , mn  = 1e18 , mx = 0;
      |        ^
joi2019_ho_t1.cpp:26:26: warning: unused variable 'z' [-Wunused-variable]
   26 |     ll q , i , j , m ,n, z ,s = 0 , f, l , r , k , x , y , mn  = 1e18 , mx = 0;
      |                          ^
joi2019_ho_t1.cpp:26:37: warning: unused variable 'f' [-Wunused-variable]
   26 |     ll q , i , j , m ,n, z ,s = 0 , f, l , r , k , x , y , mn  = 1e18 , mx = 0;
      |                                     ^
joi2019_ho_t1.cpp:26:40: warning: unused variable 'l' [-Wunused-variable]
   26 |     ll q , i , j , m ,n, z ,s = 0 , f, l , r , k , x , y , mn  = 1e18 , mx = 0;
      |                                        ^
joi2019_ho_t1.cpp:26:44: warning: unused variable 'r' [-Wunused-variable]
   26 |     ll q , i , j , m ,n, z ,s = 0 , f, l , r , k , x , y , mn  = 1e18 , mx = 0;
      |                                            ^
joi2019_ho_t1.cpp:26:48: warning: unused variable 'k' [-Wunused-variable]
   26 |     ll q , i , j , m ,n, z ,s = 0 , f, l , r , k , x , y , mn  = 1e18 , mx = 0;
      |                                                ^
joi2019_ho_t1.cpp:26:52: warning: unused variable 'x' [-Wunused-variable]
   26 |     ll q , i , j , m ,n, z ,s = 0 , f, l , r , k , x , y , mn  = 1e18 , mx = 0;
      |                                                    ^
joi2019_ho_t1.cpp:26:56: warning: unused variable 'y' [-Wunused-variable]
   26 |     ll q , i , j , m ,n, z ,s = 0 , f, l , r , k , x , y , mn  = 1e18 , mx = 0;
      |                                                        ^
joi2019_ho_t1.cpp:26:60: warning: unused variable 'mn' [-Wunused-variable]
   26 |     ll q , i , j , m ,n, z ,s = 0 , f, l , r , k , x , y , mn  = 1e18 , mx = 0;
      |                                                            ^~
joi2019_ho_t1.cpp:26:73: warning: unused variable 'mx' [-Wunused-variable]
   26 |     ll q , i , j , m ,n, z ,s = 0 , f, l , r , k , x , y , mn  = 1e18 , mx = 0;
      |                                                                         ^~

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4564 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct

Subtask #2
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4564 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 5 ms 13144 KB Output is correct
15 Correct 1 ms 10584 KB Output is correct
16 Correct 3 ms 6748 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 5 ms 12900 KB Output is correct
19 Correct 5 ms 13148 KB Output is correct
20 Correct 4 ms 13044 KB Output is correct
21 Correct 5 ms 12892 KB Output is correct
22 Correct 4 ms 12892 KB Output is correct
23 Correct 4 ms 13044 KB Output is correct
24 Correct 6 ms 12892 KB Output is correct
25 Correct 5 ms 12892 KB Output is correct
26 Correct 4 ms 13040 KB Output is correct

Subtask #3
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4564 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 5 ms 13144 KB Output is correct
15 Correct 1 ms 10584 KB Output is correct
16 Correct 3 ms 6748 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 5 ms 12900 KB Output is correct
19 Correct 5 ms 13148 KB Output is correct
20 Correct 4 ms 13044 KB Output is correct
21 Correct 5 ms 12892 KB Output is correct
22 Correct 4 ms 12892 KB Output is correct
23 Correct 4 ms 13044 KB Output is correct
24 Correct 6 ms 12892 KB Output is correct
25 Correct 5 ms 12892 KB Output is correct
26 Correct 4 ms 13040 KB Output is correct
27 Correct 129 ms 79500 KB Output is correct
28 Correct 6 ms 56152 KB Output is correct
29 Correct 9 ms 7260 KB Output is correct
30 Correct 1 ms 2392 KB Output is correct
31 Correct 91 ms 66132 KB Output is correct
32 Correct 113 ms 79692 KB Output is correct
33 Correct 110 ms 79660 KB Output is correct
34 Correct 109 ms 77284 KB Output is correct
35 Correct 117 ms 79932 KB Output is correct
36 Correct 124 ms 79700 KB Output is correct
37 Correct 133 ms 79988 KB Output is correct
38 Correct 78 ms 66124 KB Output is correct
39 Correct 79 ms 66128 KB Output is correct