oj.uz

Submission #556524

# Submission time Handle Problem Language Result Execution time Memory
556524 2022-05-03T09:47:24 Z n0sk1ll Bitaro the Brave (JOI19_ho_t1) C++14
100 / 100
 117 ms 88644 KB 
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

#define FAST ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);cerr.tie(0)
#define mp make_pair
#define xx first
#define yy second
#define pb push_back
#define pf push_front
#define popb pop_back
#define popf pop_front
#define all(x) (x).begin(),(x).end()
#define erase_uni(x) x.erase(unique(all(x)),x.end())
#define inv(n) power((n), mod - 2)
#define ff(i,a,b) for (int (i) = (a); (i) < (b); (i)++)
#define fff(i,a,b) for (int (i) = (a); (i) <= b; (i)++)
#define bff(i,a,b) for (int (i) = (b)-1; (i) >= (a); (i)--)
#define bfff(i,a,b) for (int (i) = (b); (i) >= (a); (i)--)
#define sum_overflow(a,b) __builtin_add_overflow_p ((a), (b), (__typeof__ ((a) + (b))) 0)
#define mul_overflow(a,b) __builtin_mul_overflow_p ((a), (b), (__typeof__ ((a) + (b))) 0)

using namespace std;
long double typedef ld;
unsigned int typedef ui;
long long int typedef li;
pair<int,int> typedef pii;
pair<li,li> typedef pli;
pair<ld,ld> typedef pld;
vector<vector<int>> typedef graph;
unsigned long long int typedef ull;
//const int mod = 998244353;
const int mod = 1000000007;

/*using namespace __gnu_pbds;
template <class T> using oset = tree<T, null_type,less<T>, rb_tree_tag,tree_order_statistics_node_update>;
template <class T> using omset = tree<T, null_type,less_equal<T>, rb_tree_tag,tree_order_statistics_node_update>;*/







//Note to self: Check for overflow

char tab[3005][3005];
int prer[3005][3005];
int prec[3005][3005];

int main()
{
    FAST;

    li ans=0;
    int n,m; cin>>n>>m;
    fff(i,1,n)
    {
        string s; cin>>s;
        fff(j,1,m) tab[i][j]=s[j-1];
    }
    fff(i,1,n) fff(j,1,m) prer[i][j]=prer[i][j-1]+(tab[i][j]=='O');
    fff(i,1,n) fff(j,1,m) prec[i][j]=prec[i-1][j]+(tab[i][j]=='I');
    fff(i,1,n) fff(j,1,m) if (tab[i][j]=='J') ans+=(prer[i][m]-prer[i][j-1])*(prec[n][j]-prec[i-1][j]);
    cout<<ans;
}

//Note to self: Check for overflow

Compilation message

joi2019_ho_t1.cpp: In function 'int main()':
joi2019_ho_t1.cpp:17:29: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   17 | #define fff(i,a,b) for (int (i) = (a); (i) <= b; (i)++)
      |                             ^
joi2019_ho_t1.cpp:57:5: note: in expansion of macro 'fff'
   57 |     fff(i,1,n)
      |     ^~~
joi2019_ho_t1.cpp:17:29: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
   17 | #define fff(i,a,b) for (int (i) = (a); (i) <= b; (i)++)
      |                             ^
joi2019_ho_t1.cpp:60:9: note: in expansion of macro 'fff'
   60 |         fff(j,1,m) tab[i][j]=s[j-1];
      |         ^~~
joi2019_ho_t1.cpp:17:29: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   17 | #define fff(i,a,b) for (int (i) = (a); (i) <= b; (i)++)
      |                             ^
joi2019_ho_t1.cpp:62:5: note: in expansion of macro 'fff'
   62 |     fff(i,1,n) fff(j,1,m) prer[i][j]=prer[i][j-1]+(tab[i][j]=='O');
      |     ^~~
joi2019_ho_t1.cpp:17:29: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
   17 | #define fff(i,a,b) for (int (i) = (a); (i) <= b; (i)++)
      |                             ^
joi2019_ho_t1.cpp:62:16: note: in expansion of macro 'fff'
   62 |     fff(i,1,n) fff(j,1,m) prer[i][j]=prer[i][j-1]+(tab[i][j]=='O');
      |                ^~~
joi2019_ho_t1.cpp:17:29: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   17 | #define fff(i,a,b) for (int (i) = (a); (i) <= b; (i)++)
      |                             ^
joi2019_ho_t1.cpp:63:5: note: in expansion of macro 'fff'
   63 |     fff(i,1,n) fff(j,1,m) prec[i][j]=prec[i-1][j]+(tab[i][j]=='I');
      |     ^~~
joi2019_ho_t1.cpp:17:29: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
   17 | #define fff(i,a,b) for (int (i) = (a); (i) <= b; (i)++)
      |                             ^
joi2019_ho_t1.cpp:63:16: note: in expansion of macro 'fff'
   63 |     fff(i,1,n) fff(j,1,m) prec[i][j]=prec[i-1][j]+(tab[i][j]=='I');
      |                ^~~
joi2019_ho_t1.cpp:17:29: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   17 | #define fff(i,a,b) for (int (i) = (a); (i) <= b; (i)++)
      |                             ^
joi2019_ho_t1.cpp:64:5: note: in expansion of macro 'fff'
   64 |     fff(i,1,n) fff(j,1,m) if (tab[i][j]=='J') ans+=(prer[i][m]-prer[i][j-1])*(prec[n][j]-prec[i-1][j]);
      |     ^~~
joi2019_ho_t1.cpp:17:29: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
   17 | #define fff(i,a,b) for (int (i) = (a); (i) <= b; (i)++)
      |                             ^
joi2019_ho_t1.cpp:64:16: note: in expansion of macro 'fff'
   64 |     fff(i,1,n) fff(j,1,m) if (tab[i][j]=='J') ans+=(prer[i][m]-prer[i][j-1])*(prec[n][j]-prec[i-1][j]);
      |                ^~~

Subtask #1
20.0 / 20.0

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

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 1492 KB Output is correct
6 Correct 1 ms 1492 KB Output is correct
7 Correct 1 ms 1364 KB Output is correct
8 Correct 1 ms 1492 KB Output is correct
9 Correct 1 ms 1488 KB Output is correct
10 Correct 1 ms 1364 KB Output is correct
11 Correct 1 ms 1452 KB Output is correct
12 Correct 1 ms 1492 KB Output is correct
13 Correct 1 ms 1364 KB Output is correct
14 Correct 5 ms 7456 KB Output is correct
15 Correct 3 ms 4948 KB Output is correct
16 Correct 3 ms 4308 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 6 ms 8020 KB Output is correct
19 Correct 5 ms 7896 KB Output is correct
20 Correct 5 ms 7764 KB Output is correct
21 Correct 6 ms 8020 KB Output is correct
22 Correct 5 ms 7880 KB Output is correct
23 Correct 5 ms 7764 KB Output is correct
24 Correct 6 ms 8020 KB Output is correct
25 Correct 5 ms 7920 KB Output is correct
26 Correct 5 ms 7792 KB Output is correct

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 1492 KB Output is correct
6 Correct 1 ms 1492 KB Output is correct
7 Correct 1 ms 1364 KB Output is correct
8 Correct 1 ms 1492 KB Output is correct
9 Correct 1 ms 1488 KB Output is correct
10 Correct 1 ms 1364 KB Output is correct
11 Correct 1 ms 1452 KB Output is correct
12 Correct 1 ms 1492 KB Output is correct
13 Correct 1 ms 1364 KB Output is correct
14 Correct 5 ms 7456 KB Output is correct
15 Correct 3 ms 4948 KB Output is correct
16 Correct 3 ms 4308 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 6 ms 8020 KB Output is correct
19 Correct 5 ms 7896 KB Output is correct
20 Correct 5 ms 7764 KB Output is correct
21 Correct 6 ms 8020 KB Output is correct
22 Correct 5 ms 7880 KB Output is correct
23 Correct 5 ms 7764 KB Output is correct
24 Correct 6 ms 8020 KB Output is correct
25 Correct 5 ms 7920 KB Output is correct
26 Correct 5 ms 7792 KB Output is correct
27 Correct 115 ms 88000 KB Output is correct
28 Correct 13 ms 25940 KB Output is correct
29 Correct 8 ms 7820 KB Output is correct
30 Correct 2 ms 596 KB Output is correct
31 Correct 86 ms 72632 KB Output is correct
32 Correct 86 ms 88576 KB Output is correct
33 Correct 88 ms 88136 KB Output is correct
34 Correct 93 ms 84168 KB Output is correct
35 Correct 89 ms 88488 KB Output is correct
36 Correct 86 ms 88268 KB Output is correct
37 Correct 117 ms 88644 KB Output is correct
38 Correct 74 ms 72500 KB Output is correct
39 Correct 66 ms 72324 KB Output is correct