oj.uz

Submission #580851

# Submission time Handle Problem Language Result Execution time Memory
580851 2022-06-22T02:08:21 Z Metal_Sonic Bitaro the Brave (JOI19_ho_t1) C++17
20 / 100
 7 ms 7060 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define sz(x) (int)(x).size()
#define all(x) x.begin() , x.end()
void setIO(string name = "") {
    ios_base::sync_with_stdio(false); cin.tie(nullptr);
    if(sz(name)){
        freopen((name+".in").c_str(), "r", stdin);
        freopen((name+".out").c_str(), "w", stdout);
    }
}
const int N = 3005;
int I[N][N] , O[N][N];
vector<vector<int>>J(N);
void run_test_case(){
    int n , m;cin>>n>>m;
    for(int i = 0; i < n; i++){
        string s;cin>>s;
        for(int j = 0; j < m; j++){
            if(s[j] == 'I')I[i][j]++;
            else if(s[j] == 'O')O[i][j]++;
            else J[i].push_back(j);
            if(j)O[i][j]+=O[i][j-1];
            if(i)I[i][j]+=I[i-1][j];
        }
    }
    int ans = 0;
    for(int i = 0; i < n; i++){
        for(auto it : J[i]){
            ans+=(O[i][m-1]-O[i][it])*(I[n-1][it]-I[i][it]);
        }
    }
    cout<<ans;
}
int main() {
    setIO();
    int T = 1;
    while(T--){
        run_test_case();
    }
    return 0;
}

Compilation message

joi2019_ho_t1.cpp: In function 'void setIO(std::string)':
joi2019_ho_t1.cpp:9:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
    9 |         freopen((name+".in").c_str(), "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
joi2019_ho_t1.cpp:10:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   10 |         freopen((name+".out").c_str(), "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 1300 KB Output is correct
6 Correct 1 ms 1236 KB Output is correct
7 Correct 1 ms 1176 KB Output is correct
8 Correct 1 ms 1236 KB Output is correct
9 Correct 1 ms 1176 KB Output is correct
10 Correct 1 ms 1172 KB Output is correct
11 Correct 1 ms 1236 KB Output is correct
12 Correct 1 ms 1236 KB Output is correct
13 Correct 1 ms 1108 KB Output is correct

Subtask #2
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 1300 KB Output is correct
6 Correct 1 ms 1236 KB Output is correct
7 Correct 1 ms 1176 KB Output is correct
8 Correct 1 ms 1236 KB Output is correct
9 Correct 1 ms 1176 KB Output is correct
10 Correct 1 ms 1172 KB Output is correct
11 Correct 1 ms 1236 KB Output is correct
12 Correct 1 ms 1236 KB Output is correct
13 Correct 1 ms 1108 KB Output is correct
14 Correct 6 ms 6408 KB Output is correct
15 Correct 3 ms 3796 KB Output is correct
16 Correct 4 ms 3796 KB Output is correct
17 Correct 1 ms 396 KB Output is correct
18 Correct 7 ms 7060 KB Output is correct
19 Correct 5 ms 6612 KB Output is correct
20 Incorrect 6 ms 6816 KB Output isn't correct
21 Halted 0 ms 0 KB -

Subtask #3
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 1300 KB Output is correct
6 Correct 1 ms 1236 KB Output is correct
7 Correct 1 ms 1176 KB Output is correct
8 Correct 1 ms 1236 KB Output is correct
9 Correct 1 ms 1176 KB Output is correct
10 Correct 1 ms 1172 KB Output is correct
11 Correct 1 ms 1236 KB Output is correct
12 Correct 1 ms 1236 KB Output is correct
13 Correct 1 ms 1108 KB Output is correct
14 Correct 6 ms 6408 KB Output is correct
15 Correct 3 ms 3796 KB Output is correct
16 Correct 4 ms 3796 KB Output is correct
17 Correct 1 ms 396 KB Output is correct
18 Correct 7 ms 7060 KB Output is correct
19 Correct 5 ms 6612 KB Output is correct
20 Incorrect 6 ms 6816 KB Output isn't correct
21 Halted 0 ms 0 KB -