oj.uz

Submission #123253

# Submission time Handle Problem Language Result Execution time Memory
123253 2019-06-30T22:17:02 Z duality Bitaro the Brave (JOI19_ho_t1) C++11
100 / 100
 587 ms 88412 KB 
#define DEBUG 0

#include <bits/stdc++.h>
using namespace std;

#if DEBUG
// basic debugging macros
int __i__,__j__;
#define printLine(l) for(__i__=0;__i__<l;__i__++){cout<<"-";}cout<<endl
#define printLine2(l,c) for(__i__=0;__i__<l;__i__++){cout<<c;}cout<<endl
#define printVar(n) cout<<#n<<": "<<n<<endl
#define printArr(a,l) cout<<#a<<": ";for(__i__=0;__i__<l;__i__++){cout<<a[__i__]<<" ";}cout<<endl
#define print2dArr(a,r,c) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<a[__i__][__j__]<<" ";}cout<<endl;}
#define print2dArr2(a,r,c,l) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<setw(l)<<setfill(' ')<<a[__i__][__j__]<<" ";}cout<<endl;}

// advanced debugging class
// debug 1,2,'A',"test";
class _Debug {
    public:
        template<typename T>
        _Debug& operator,(T val) {
            cout << val << endl;
            return *this;
        }
};
#define debug _Debug(),
#else
#define printLine(l)
#define printLine2(l,c)
#define printVar(n)
#define printArr(a,l)
#define print2dArr(a,r,c)
#define print2dArr2(a,r,c,l)
#define debug
#endif

// define
#define MAX_VAL 999999999
#define MAX_VAL_2 999999999999999999LL
#define EPS 1e-6
#define mp make_pair
#define pb push_back

// typedef
typedef unsigned int UI;
typedef long long int LLI;
typedef unsigned long long int ULLI;
typedef unsigned short int US;
typedef pair<int,int> pii;
typedef pair<LLI,LLI> plli;
typedef vector<int> vi;
typedef vector<LLI> vlli;
typedef vector<pii> vpii;
typedef vector<plli> vplli;

// ---------- END OF TEMPLATE ----------

char S[3000][3000];
int a[3000][3000],b[3000][3000];
int main() {
    int i,j;
    int H,W;
    scanf("%d %d",&H,&W);
    for (i = 0; i < H; i++) {
        for (j = 0; j < W; j++) scanf(" %c",&S[i][j]);
    }

    LLI ans = 0;
    for (i = H-1; i >= 0; i--) {
        for (j = W-1; j >= 0; j--) {
            a[i][j] = ((j == W-1) ? 0:a[i][j+1])+(S[i][j] == 'O');
            b[i][j] = ((i == H-1) ? 0:b[i+1][j])+(S[i][j] == 'I');
            if (S[i][j] == 'J') ans += a[i][j]*b[i][j];
        }
    }
    printf("%lld\n",ans);

    return 0;
}

Compilation message

joi2019_ho_t1.cpp: In function 'int main()':
joi2019_ho_t1.cpp:63:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d",&H,&W);
     ~~~~~^~~~~~~~~~~~~~~
joi2019_ho_t1.cpp:65:38: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         for (j = 0; j < W; j++) scanf(" %c",&S[i][j]);
                                 ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 2 ms 360 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 504 KB Output is correct
5 Correct 3 ms 1528 KB Output is correct
6 Correct 3 ms 1528 KB Output is correct
7 Correct 3 ms 1400 KB Output is correct
8 Correct 3 ms 1528 KB Output is correct
9 Correct 3 ms 1528 KB Output is correct
10 Correct 3 ms 1400 KB Output is correct
11 Correct 4 ms 1528 KB Output is correct
12 Correct 3 ms 1528 KB Output is correct
13 Correct 3 ms 1400 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 2 ms 360 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 504 KB Output is correct
5 Correct 3 ms 1528 KB Output is correct
6 Correct 3 ms 1528 KB Output is correct
7 Correct 3 ms 1400 KB Output is correct
8 Correct 3 ms 1528 KB Output is correct
9 Correct 3 ms 1528 KB Output is correct
10 Correct 3 ms 1400 KB Output is correct
11 Correct 4 ms 1528 KB Output is correct
12 Correct 3 ms 1528 KB Output is correct
13 Correct 3 ms 1400 KB Output is correct
14 Correct 20 ms 7416 KB Output is correct
15 Correct 6 ms 4984 KB Output is correct
16 Correct 12 ms 4344 KB Output is correct
17 Correct 2 ms 504 KB Output is correct
18 Correct 23 ms 7932 KB Output is correct
19 Correct 21 ms 7928 KB Output is correct
20 Correct 21 ms 7800 KB Output is correct
21 Correct 22 ms 8056 KB Output is correct
22 Correct 21 ms 7928 KB Output is correct
23 Correct 21 ms 7928 KB Output is correct
24 Correct 24 ms 8056 KB Output is correct
25 Correct 21 ms 7928 KB Output is correct
26 Correct 21 ms 7800 KB Output is correct

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 2 ms 360 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 504 KB Output is correct
5 Correct 3 ms 1528 KB Output is correct
6 Correct 3 ms 1528 KB Output is correct
7 Correct 3 ms 1400 KB Output is correct
8 Correct 3 ms 1528 KB Output is correct
9 Correct 3 ms 1528 KB Output is correct
10 Correct 3 ms 1400 KB Output is correct
11 Correct 4 ms 1528 KB Output is correct
12 Correct 3 ms 1528 KB Output is correct
13 Correct 3 ms 1400 KB Output is correct
14 Correct 20 ms 7416 KB Output is correct
15 Correct 6 ms 4984 KB Output is correct
16 Correct 12 ms 4344 KB Output is correct
17 Correct 2 ms 504 KB Output is correct
18 Correct 23 ms 7932 KB Output is correct
19 Correct 21 ms 7928 KB Output is correct
20 Correct 21 ms 7800 KB Output is correct
21 Correct 22 ms 8056 KB Output is correct
22 Correct 21 ms 7928 KB Output is correct
23 Correct 21 ms 7928 KB Output is correct
24 Correct 24 ms 8056 KB Output is correct
25 Correct 21 ms 7928 KB Output is correct
26 Correct 21 ms 7800 KB Output is correct
27 Correct 554 ms 87888 KB Output is correct
28 Correct 22 ms 25976 KB Output is correct
29 Correct 44 ms 7800 KB Output is correct
30 Correct 3 ms 632 KB Output is correct
31 Correct 428 ms 72556 KB Output is correct
32 Correct 568 ms 88412 KB Output is correct
33 Correct 552 ms 88076 KB Output is correct
34 Correct 477 ms 84080 KB Output is correct
35 Correct 549 ms 88312 KB Output is correct
36 Correct 549 ms 88092 KB Output is correct
37 Correct 587 ms 88312 KB Output is correct
38 Correct 426 ms 72432 KB Output is correct
39 Correct 404 ms 72180 KB Output is correct