oj.uz

답안 #386777

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
386777 2021-04-07T09:41:58 Z cpp219 Bitaro the Brave (JOI19_ho_t1) C++14
20 / 100
 11 ms 8172 KB 
#pragma GCC optimization "Ofast"
#pragma GCC optimization "unroll-loop"
#pragma GCC target ("avx2")

#include <bits/stdc++.h>
#define ll int
#define ld long double
#define fs first
#define sc second
using namespace std;
const ll N = 3e3 + 6;
const ll Log2 = 19;
const ll inf = 1e16 + 7;
typedef pair<ll,ll> LL;

ll n,m,cntO[N][N],cntI[N][N];
char a[N][N];
int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    #define task "tst"
    if (fopen(task".inp", "r")){
        freopen(task".inp", "r", stdin);
        //freopen(task".out", "w", stdout);
    }
    cin>>n>>m;
    for (ll i = 1;i <= n;i++){
        for (ll j = 1;j <= m;j++){
            cin>>a[i][j];
            cntI[i][j] = cntI[i - 1][j] + (a[i][j] == 'I');
            cntO[i][j] = cntO[i][j - 1] + (a[i][j] == 'O');
        }
    }
    ll ans = 0;
    for (ll i = 1;i <= n;i++){
        for (ll j = 1;j <= m;j++) if (a[i][j] == 'J'){
            ll p = cntO[i][m] - cntO[i][j - 1],q = cntI[n][j] - cntI[i - 1][j];
            ans += p*q;
        }
    }
    cout<<ans;
}

Compilation message

joi2019_ho_t1.cpp:1: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
    1 | #pragma GCC optimization "Ofast"
      | 
joi2019_ho_t1.cpp:2: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
    2 | #pragma GCC optimization "unroll-loop"
      | 
joi2019_ho_t1.cpp:13:21: warning: overflow in conversion from 'double' to 'int' changes value from '1.0000000000000008e+16' to '2147483647' [-Woverflow]
   13 | const ll inf = 1e16 + 7;
      |                ~~~~~^~~
joi2019_ho_t1.cpp: In function 'int main()':
joi2019_ho_t1.cpp:23:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   23 |         freopen(task".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 492 KB Output is correct
5 Correct 2 ms 1644 KB Output is correct
6 Correct 2 ms 1516 KB Output is correct
7 Correct 2 ms 1388 KB Output is correct
8 Correct 2 ms 1516 KB Output is correct
9 Correct 2 ms 1516 KB Output is correct
10 Correct 2 ms 1388 KB Output is correct
11 Correct 2 ms 1516 KB Output is correct
12 Correct 3 ms 1516 KB Output is correct
13 Correct 3 ms 1388 KB Output is correct

Subtask #2
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 492 KB Output is correct
5 Correct 2 ms 1644 KB Output is correct
6 Correct 2 ms 1516 KB Output is correct
7 Correct 2 ms 1388 KB Output is correct
8 Correct 2 ms 1516 KB Output is correct
9 Correct 2 ms 1516 KB Output is correct
10 Correct 2 ms 1388 KB Output is correct
11 Correct 2 ms 1516 KB Output is correct
12 Correct 3 ms 1516 KB Output is correct
13 Correct 3 ms 1388 KB Output is correct
14 Correct 9 ms 7532 KB Output is correct
15 Correct 4 ms 4972 KB Output is correct
16 Correct 6 ms 4332 KB Output is correct
17 Correct 2 ms 492 KB Output is correct
18 Correct 11 ms 8172 KB Output is correct
19 Correct 10 ms 7916 KB Output is correct
20 Incorrect 10 ms 7916 KB Output isn't correct
21 Halted 0 ms 0 KB -

Subtask #3
0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 492 KB Output is correct
5 Correct 2 ms 1644 KB Output is correct
6 Correct 2 ms 1516 KB Output is correct
7 Correct 2 ms 1388 KB Output is correct
8 Correct 2 ms 1516 KB Output is correct
9 Correct 2 ms 1516 KB Output is correct
10 Correct 2 ms 1388 KB Output is correct
11 Correct 2 ms 1516 KB Output is correct
12 Correct 3 ms 1516 KB Output is correct
13 Correct 3 ms 1388 KB Output is correct
14 Correct 9 ms 7532 KB Output is correct
15 Correct 4 ms 4972 KB Output is correct
16 Correct 6 ms 4332 KB Output is correct
17 Correct 2 ms 492 KB Output is correct
18 Correct 11 ms 8172 KB Output is correct
19 Correct 10 ms 7916 KB Output is correct
20 Incorrect 10 ms 7916 KB Output isn't correct
21 Halted 0 ms 0 KB -