Submission #556524

#	Time	Username	Problem	Language	Result	Execution time	Memory
556524		n0sk1ll	Bitaro the Brave (JOI19_ho_t1)	C++14	100 / 100	117 ms	88644 KiB

joi2019_ho_t1

#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 (stderr)

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 / 20
• Subtask 2: 30 / 30
• Subtask 3: 50 / 50