oj.uz

Submission #717825

# Submission time Handle Problem Language Result Execution time Memory
717825 2023-04-02T15:47:11 Z nnin Bitaro the Brave (JOI19_ho_t1) C++14
20 / 100
 13 ms 2552 KB 
#include<bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
#define f first
#define s second
using namespace std;

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int H, W;
    cin>>H>>W;
    vector<int> O[H];
    vector<int> I[W];
    vector<pii> J;
    for(int i=0;i<H;i++) {
        string s;
        cin>>s;
        for(int j=0;j<W;j++) {
            if(s[j]=='O') O[i].push_back(j);
            else if(s[j]=='I') I[j].push_back(i);
            else J.push_back({i, j});
        }
    }
    int ans = 0;
    for(pii j:J) {
        int o = O[j.f].end()-upper_bound(O[j.f].begin(), O[j.f].end(), j.s);
        int i = I[j.s].end()-upper_bound(I[j.s].begin(), I[j.s].end(), j.f);
        ans += i*o;
    }
    cout<<ans;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 328 KB Output is correct

Subtask #2
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 328 KB Output is correct
14 Correct 9 ms 1868 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 4 ms 1360 KB Output is correct
17 Correct 1 ms 320 KB Output is correct
18 Correct 13 ms 2552 KB Output is correct
19 Correct 5 ms 1872 KB Output is correct
20 Incorrect 5 ms 1940 KB Output isn't correct
21 Halted 0 ms 0 KB -

Subtask #3
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 328 KB Output is correct
14 Correct 9 ms 1868 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 4 ms 1360 KB Output is correct
17 Correct 1 ms 320 KB Output is correct
18 Correct 13 ms 2552 KB Output is correct
19 Correct 5 ms 1872 KB Output is correct
20 Incorrect 5 ms 1940 KB Output isn't correct
21 Halted 0 ms 0 KB -