oj.uz

답안 #547383

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
547383 2022-04-10T15:06:46 Z duality Misspelling (JOI22_misspelling) C++17
100 / 100
 635 ms 114728 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 ----------
#define MOD 1000000007

int lazy1[1 << 20],lazy2[1 << 20];
int build(int s,int e,int i) {
    if (s == e) {
        lazy1[i] = lazy2[i] = -1;
        return 0;
    }

    int mid = (s+e) / 2;
    build(s,mid,2*i+1),build(mid+1,e,2*i+2);
    lazy1[i] = lazy2[i] = -1;
    return 0;
}
int update(int s,int e,int as,int ae,int i,int t,int num) {
    if ((s > ae) || (e < as)) return 0;
    else if ((s >= as) && (e <= ae)) {
        if (t == 1) lazy1[i] = max(lazy1[i],num);
        else lazy2[i] = max(lazy2[i],num);
        return 0;
    }

    int mid = (s+e) / 2;
    update(s,mid,as,ae,2*i+1,t,num),update(mid+1,e,as,ae,2*i+2,t,num);
    return 0;
}
int l1[500000],l2[500000];
int process(int s,int e,int i) {
    if (s == e) {
        l1[s] = lazy1[i],l2[s] = lazy2[i];
        return 0;
    }

    int mid = (s+e) / 2;
    lazy1[2*i+1] = max(lazy1[2*i+1],lazy1[i]);
    lazy1[2*i+2] = max(lazy1[2*i+2],lazy1[i]);
    lazy2[2*i+1] = max(lazy2[2*i+1],lazy2[i]);
    lazy2[2*i+2] = max(lazy2[2*i+2],lazy2[i]);
    process(s,mid,2*i+1),process(mid+1,e,2*i+2);
    return 0;
}
int dp[500000][26],pre[500001][26];
int main() {
    int i;
    int N,M,A,B;
    scanf("%d %d",&N,&M);
    build(0,N-1,0);
    for (i = 0; i < M; i++) {
        scanf("%d %d",&A,&B);
        A--,B--;
        if (A < B) update(0,N-1,A,B-1,0,1,A);
        else update(0,N-1,B,A-1,0,2,B);
    }
    process(0,N-1,0);

    int j,k;
    for (i = 0; i < 26; i++) dp[0][i] = pre[1][i] = 1;
    for (i = 1; i < N; i++) {
        j = 0;
        for (k = 0; k < 26; k++) {
            if (j == k) continue;
            if (j > k) dp[i][j] = ((LLI) dp[i][j]+pre[i][k]-pre[l1[i-1]+1][k]+MOD) % MOD;
            else dp[i][j] = ((LLI) dp[i][j]+pre[i][k]-pre[l2[i-1]+1][k]+MOD) % MOD;
        }
        for (j = 1; j < 26; j++) {
            dp[i][j] = dp[i][j-1];
            dp[i][j] = ((LLI) dp[i][j]+pre[i][j-1]-pre[l1[i-1]+1][j-1]+MOD) % MOD;
            dp[i][j] = ((LLI) dp[i][j]-(pre[i][j]-pre[l2[i-1]+1][j])+MOD) % MOD;
        }
        for (j = 0; j < 26; j++) pre[i+1][j] = (pre[i][j]+dp[i][j]) % MOD;
    }
    int ans = 0;
    for (i = 0; i < 26; i++) ans = (ans+pre[N][i]) % MOD;
    printf("%d\n",ans);

    return 0;
}

Compilation message

misspelling.cpp: In function 'int main()':
misspelling.cpp:102:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  102 |     scanf("%d %d",&N,&M);
      |     ~~~~~^~~~~~~~~~~~~~~
misspelling.cpp:105:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  105 |         scanf("%d %d",&A,&B);
      |         ~~~~~^~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 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 340 KB Output is correct
6 Correct 1 ms 308 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 308 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 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 340 KB Output is correct
6 Correct 1 ms 308 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 308 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 4 ms 340 KB Output is correct
23 Correct 0 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct

Subtask #3
29.0 / 29.0

# 결과 실행 시간 메모리 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 457 ms 114592 KB Output is correct
6 Correct 456 ms 114660 KB Output is correct
7 Correct 444 ms 114632 KB Output is correct
8 Correct 453 ms 114564 KB Output is correct
9 Correct 459 ms 114584 KB Output is correct
10 Correct 18 ms 5076 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 627 ms 114524 KB Output is correct

Subtask #4
32.0 / 32.0

# 결과 실행 시간 메모리 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 340 KB Output is correct
6 Correct 1 ms 308 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 308 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 4 ms 340 KB Output is correct
23 Correct 0 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 18 ms 5064 KB Output is correct
27 Correct 16 ms 5076 KB Output is correct
28 Correct 16 ms 5068 KB Output is correct
29 Correct 21 ms 5056 KB Output is correct
30 Correct 20 ms 4968 KB Output is correct
31 Correct 254 ms 5428 KB Output is correct
32 Correct 17 ms 5068 KB Output is correct
33 Correct 17 ms 5076 KB Output is correct
34 Correct 22 ms 5056 KB Output is correct
35 Correct 266 ms 5312 KB Output is correct
36 Correct 10 ms 4988 KB Output is correct
37 Correct 19 ms 4972 KB Output is correct
38 Correct 17 ms 5064 KB Output is correct
39 Correct 13 ms 5060 KB Output is correct

Subtask #5
11.0 / 11.0

# 결과 실행 시간 메모리 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 340 KB Output is correct
6 Correct 1 ms 308 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 308 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 4 ms 340 KB Output is correct
23 Correct 0 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 457 ms 114592 KB Output is correct
31 Correct 456 ms 114660 KB Output is correct
32 Correct 444 ms 114632 KB Output is correct
33 Correct 453 ms 114564 KB Output is correct
34 Correct 459 ms 114584 KB Output is correct
35 Correct 18 ms 5076 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 627 ms 114524 KB Output is correct
39 Correct 18 ms 5064 KB Output is correct
40 Correct 16 ms 5076 KB Output is correct
41 Correct 16 ms 5068 KB Output is correct
42 Correct 21 ms 5056 KB Output is correct
43 Correct 20 ms 4968 KB Output is correct
44 Correct 254 ms 5428 KB Output is correct
45 Correct 17 ms 5068 KB Output is correct
46 Correct 17 ms 5076 KB Output is correct
47 Correct 22 ms 5056 KB Output is correct
48 Correct 266 ms 5312 KB Output is correct
49 Correct 10 ms 4988 KB Output is correct
50 Correct 19 ms 4972 KB Output is correct
51 Correct 17 ms 5064 KB Output is correct
52 Correct 13 ms 5060 KB Output is correct
53 Correct 411 ms 114452 KB Output is correct
54 Correct 398 ms 114352 KB Output is correct
55 Correct 542 ms 114092 KB Output is correct
56 Correct 553 ms 114680 KB Output is correct
57 Correct 456 ms 114728 KB Output is correct
58 Correct 443 ms 114364 KB Output is correct
59 Correct 434 ms 114380 KB Output is correct
60 Correct 635 ms 114424 KB Output is correct
61 Correct 247 ms 114124 KB Output is correct
62 Correct 529 ms 114540 KB Output is correct
63 Correct 439 ms 114396 KB Output is correct
64 Correct 355 ms 114252 KB Output is correct