oj.uz

답안 #254636

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
254636 2020-07-30T11:34:49 Z Nucleist Bitaro the Brave (JOI19_ho_t1) C++14
100 / 100
 902 ms 88696 KB 
//Self-control leads to consistency.
#include <bits/stdc++.h> 
using namespace std; 
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#define flash ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define debug(x) cerr << " - " << #x << ": " << x << endl;
#define debugs(x, y) cerr << " - " << #x << ": " << x << " " << #y << ": " << y << endl;
#define all(x) (x).begin(),(x).end()
#define sz(x) (ll)x.size()
#define ll long long
#define INF 1000000000
#define MOD 1000000007
#define pb push_back
#define ve vector<ll>
#define dos pair<ll,ll>
#define vedos vector<dos>
#define rand mt19937 rng(chrono::steady_clock::now().time_since_epoch().count())
#define EPS 0.000001
struct greateri
{
    template<class T>
    bool operator()(T const &a, T const &b) const { return a > b; }
};
void setIO(string s) {
  ios_base::sync_with_stdio(0); cin.tie(0); 
  freopen((s+".in").c_str(),"r",stdin);
  freopen((s+".out").c_str(),"w",stdout);
}
char tab[3001][3001];
int cum1[3001][3001],cum2[3001][3001];
int main()
{
  //flash;
  int n,m;
  cin>>n>>m;
  for (int i = 0; i < n; ++i)
  {
    for (int j = 0; j < m; ++j)
    {
      cin>>tab[i][j];
      if(tab[i][j]=='O')cum1[i][j]++;
      if(tab[i][j]=='I')cum2[i][j]++;
    }
  }
  for (int i = 0; i < n; ++i)
  {
    for (int j = 0; j < m; ++j)
    {
      if(j)cum1[i][j]+=cum1[i][j-1];
      if(i)cum2[i][j]+=cum2[i-1][j];
    }
  }
  ll ans=0;
  for (int i = 0; i < n; ++i)
  {
    for (int j = 0; j < m; ++j)
    {
      if(tab[i][j]=='J'){
        ans+=(cum1[i][m-1]-cum1[i][j])*(cum2[n-1][j]-cum2[i][j]);
      }
    }
  }
  cout<<ans;
  return 0;
}

Compilation message

joi2019_ho_t1.cpp:5:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 #pragma GCC optimization ("O3")
 
joi2019_ho_t1.cpp:6:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 #pragma GCC optimization ("unroll-loops")
 
joi2019_ho_t1.cpp: In function 'void setIO(std::__cxx11::string)':
joi2019_ho_t1.cpp:28:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   freopen((s+".in").c_str(),"r",stdin);
   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
joi2019_ho_t1.cpp:29:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   freopen((s+".out").c_str(),"w",stdout);
   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 1 ms 512 KB Output is correct
5 Correct 2 ms 1536 KB Output is correct
6 Correct 2 ms 1536 KB Output is correct
7 Correct 2 ms 1408 KB Output is correct
8 Correct 2 ms 1536 KB Output is correct
9 Correct 2 ms 1536 KB Output is correct
10 Correct 2 ms 1408 KB Output is correct
11 Correct 2 ms 1536 KB Output is correct
12 Correct 2 ms 1536 KB Output is correct
13 Correct 2 ms 1408 KB Output is correct

Subtask #2
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 1 ms 512 KB Output is correct
5 Correct 2 ms 1536 KB Output is correct
6 Correct 2 ms 1536 KB Output is correct
7 Correct 2 ms 1408 KB Output is correct
8 Correct 2 ms 1536 KB Output is correct
9 Correct 2 ms 1536 KB Output is correct
10 Correct 2 ms 1408 KB Output is correct
11 Correct 2 ms 1536 KB Output is correct
12 Correct 2 ms 1536 KB Output is correct
13 Correct 2 ms 1408 KB Output is correct
14 Correct 22 ms 7456 KB Output is correct
15 Correct 4 ms 4992 KB Output is correct
16 Correct 14 ms 4224 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 29 ms 7928 KB Output is correct
19 Correct 26 ms 7928 KB Output is correct
20 Correct 25 ms 7808 KB Output is correct
21 Correct 29 ms 8056 KB Output is correct
22 Correct 26 ms 7928 KB Output is correct
23 Correct 26 ms 7808 KB Output is correct
24 Correct 28 ms 7928 KB Output is correct
25 Correct 25 ms 7936 KB Output is correct
26 Correct 26 ms 7800 KB Output is correct

Subtask #3
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 1 ms 512 KB Output is correct
5 Correct 2 ms 1536 KB Output is correct
6 Correct 2 ms 1536 KB Output is correct
7 Correct 2 ms 1408 KB Output is correct
8 Correct 2 ms 1536 KB Output is correct
9 Correct 2 ms 1536 KB Output is correct
10 Correct 2 ms 1408 KB Output is correct
11 Correct 2 ms 1536 KB Output is correct
12 Correct 2 ms 1536 KB Output is correct
13 Correct 2 ms 1408 KB Output is correct
14 Correct 22 ms 7456 KB Output is correct
15 Correct 4 ms 4992 KB Output is correct
16 Correct 14 ms 4224 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 29 ms 7928 KB Output is correct
19 Correct 26 ms 7928 KB Output is correct
20 Correct 25 ms 7808 KB Output is correct
21 Correct 29 ms 8056 KB Output is correct
22 Correct 26 ms 7928 KB Output is correct
23 Correct 26 ms 7808 KB Output is correct
24 Correct 28 ms 7928 KB Output is correct
25 Correct 25 ms 7936 KB Output is correct
26 Correct 26 ms 7800 KB Output is correct
27 Correct 858 ms 88184 KB Output is correct
28 Correct 15 ms 25984 KB Output is correct
29 Correct 59 ms 7800 KB Output is correct
30 Correct 3 ms 640 KB Output is correct
31 Correct 636 ms 72828 KB Output is correct
32 Correct 828 ms 88440 KB Output is correct
33 Correct 786 ms 88184 KB Output is correct
34 Correct 738 ms 84216 KB Output is correct
35 Correct 830 ms 88696 KB Output is correct
36 Correct 784 ms 88184 KB Output is correct
37 Correct 902 ms 88496 KB Output is correct
38 Correct 577 ms 72440 KB Output is correct
39 Correct 555 ms 72440 KB Output is correct