oj.uz

답안 #420304

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
420304 2021-06-08T09:27:00 Z b00n0rp Crossing (JOI21_crossing) C++17
100 / 100
 3005 ms 37900 KB 
// --------------------------------------------------<TEMPLATE>--------------------------------------------------
// --------------------<optimizations>--------------------
/*
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx,avx2,fma")
*/ 
// -------------------</optimizations>--------------------
 
// ---------------<Headers and namespaces>----------------
#include <bits/stdc++.h>
using namespace std;
 
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
*/
 
// ---------------</Headers and namespaces>---------------
 
// -----------------<Defines and typedefs>----------------
// typedef tree<int,null_type,less<int>,rb_tree_tag, 
// tree_order_statistics_node_update> indexed_set; // use less_equal for multiset
// order_of_key (val): returns the no. of values less than val
// find_by_order (k): returns the iterator to kth largest element.(0-based)
 
typedef long double LD;
typedef long long ll;
#define int ll
#define pb push_back
#define mp make_pair
#define REP(i,n) for (int i = 0; i < n; i++)
#define FOR(i,a,b) for (int i = a; i < b; i++)
#define REPD(i,n) for (int i = n-1; i >= 0; i--)
#define FORD(i,a,b) for (int i = a; i >= b; i--)
#define remax(a,b) a = max(a,b)
#define remin(a,b) a = min(a,b)
#define all(v) v.begin(),v.end()
typedef map<int,int> mii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> pii;
typedef vector<pii> vpii;
#define F first
#define S second
#define PQ(type) priority_queue<type>
#define PQD(type) priority_queue<type,vector<type>,greater<type> >
#define WL(t) while(t --)
#define SZ(x) ((int)(x).size())
#define runtime() ((double)clock() / CLOCKS_PER_SEC)
#define inrange(i,a,b) ((i>=min(a,b)) && (i<=max(a,b)))
 
/*
// -----<SCANF>-----
#define sfi(x) scanf("%d",&x);
#define sfi2(x,y) scanf("%d%d",&x,&y);
#define sfi3(x,y,z) scanf("%d%d%d",&x,&y,&z);
 
#define sfl(x) scanf("%lld",&x);
#define sfl2(x,y) scanf("%lld%lld",&x,&y);
#define sfl3(x,y,z) scanf("%lld%lld%lld",&x,&y,&z);
#define sfl4(x,y,z,x1) scanf("%lld%lld%lld%lld",&x,&y,&z,&x1);
#define sfl5(x,y,z,x1,y1) scanf("%lld%lld%lld%lld%lld",&x,&y,&z,&x1,&y1);
#define sfl6(x,y,z,x1,y1,z1) scanf("%lld%lld%lld%lld%lld%lld",&x,&y,&z,&x1,&y1,&z1);
 
#define sfs(x) scanf("%s",x);
#define sfs2(x,y) scanf("%s%s",x,y);
#define sfs3(x,y,z) scanf("%s%s%s",x,y,z);
// ----</SCANF>-----
 
// ----<PRINTF>-----
#define pfi(x) printf("%d\n",x);
#define pfi2(x,y) printf("%d %d\n",x,y);
#define pfi3(x,y,z) printf("%d %d %d\n",x,y,z);
 
#define pfl(x) printf("%lld\n",x);
#define pfl2(x,y) printf("%lld %lld\n",x,y);
#define pfl3(x,y,z) printf("%lld %lld %lld\n",x,y,z);
 
#define pfs(x) printf("%s\n",x);
#define pfs2(x,y) printf("%s %s\n",x,y);
#define pfs3(x,y,z) printf("%s %s %s\n",x,y,z);
 
#define pwe(x) printf("%lld ",x); // print without end
// ----</PRINTF>----
*/
#define FLSH fflush(stdout)
#define fileIO(name) \
    freopen(name".in", "r", stdin); \
    freopen(name".out", "w", stdout);
#define PRECISION(x) cout << fixed << setprecision(x); 
#define FAST_IO ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
 
// ----------------</Defines and typedefs>----------------
 
// -------------------<Debugging stuff>-------------------
#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
    cout << name << " : " << arg1 << std::endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
    const char* comma = strchr(names + 1, ',');cout.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...);
}
#else
#define trace(...)
#endif
 
// ------------------</Debugging stuff>-------------------
 
// ------------------------<Consts>-----------------------
const int MAXN = 200005;
const int SQRTN = 1003;
const int LOGN = 22;
const double PI=acos(-1);
 
#ifdef int
const int INF=1e16;
#else
const int INF=1e9;
#endif
 
const int MOD = 1000000007;
const int FMOD = 998244353;
const double eps = 1e-9;
// -----------------------</Consts>-----------------------
/*
// -------------------------<RNG>-------------------------
mt19937 RNG(chrono::steady_clock::now().time_since_epoch().count()); 
#define SHUF(v) shuffle(all(v), RNG);
// Use mt19937_64 for 64 bit random numbers.
 
// ------------------------</RNG>-------------------------
 
// ----------------------<MATH>---------------------------
template<typename T> T gcd(T a, T b){return(b?__gcd(a,b):a);}
template<typename T> T lcm(T a, T b){return(a*(b/gcd(a,b)));}
int add(int a, int b, int c = MOD){int res=a+b;return(res>=c?res-c:res);}
int mod_neg(int a, int b, int c = MOD){int res;if(abs(a-b)<c)res=a-b;else res=(a-b)%c;return(res<0?res+c:res);}
int mul(int a, int b, int c = MOD){ll res=(ll)a*b;return(res>=c?res%c:res);}
int muln(int a, int b, int c = MOD){ll res=(ll)a*b;return ((res%c)+c)%c;}
ll mulmod(ll a,ll b, ll m = MOD){ll q = (ll)(((LD)a*(LD)b)/(LD)m);ll r=a*b-q*m;if(r>m)r%=m;if(r<0)r+=m;return r;}
template<typename T>T expo(T e, T n){T x=1,p=e;while(n){if(n&1)x=x*p;p=p*p;n>>=1;}return x;}
template<typename T>T power(T e, T n, T m = MOD){T x=1,p=e;while(n){if(n&1)x=mul(x,p,m);p=mul(p,p,m);n>>=1;}return x;}
template<typename T>T extended_euclid(T a, T b, T &x, T &y){T xx=0,yy=1;y=0;x=1;while(b){T q=a/b,t=b;b=a%b;a=t;\
t=xx;xx=x-q*xx;x=t;t=yy;yy=y-q*yy;y=t;}return a;}
template<typename T>T mod_inverse(T a, T n = MOD){T x,y,z=0;T d=extended_euclid(a,n,x,y);return(d>1?-1:mod_neg(x,z,n));}
 
const int FACSZ = 1; // Make sure to change this
 
int fact[FACSZ],ifact[FACSZ];
 
void precom(int c = MOD){
    fact[0] = 1;
    FOR(i,1,FACSZ) fact[i] = mul(fact[i-1],i,c);
    ifact[FACSZ-1] = mod_inverse(fact[FACSZ-1],c);
    REPD(i,FACSZ-1){
        ifact[i] = mul(i+1,ifact[i+1],c);
    }
}
 
int ncr(int n,int r,int c = MOD){
    return mul(mul(ifact[r],ifact[n-r],c),fact[n],c);
} 
*/
// ----------------------</MATH>--------------------------
// --------------------------------------------------</TEMPLATE>--------------------------------------------------
 
void solvethetestcase();
 
signed main(){
    // comment when using scanf,printf
    FAST_IO
    int t = 1;
    // (UNCOMMENT FOR MULTIPLE TEST CASES)
    // cin >> t;
    FOR(testcase,1,t+1){
        // (UNCOMMENT FOR CODEJAM)
        // printf("Case #%lld: ",testcase); 
        solvethetestcase();
    }
}   
 
int n,q;
int s[MAXN];
int t[MAXN];
int pref[MAXN][3];
int a[10][MAXN];
int ans[MAXN];
pair<pii,int> quer[MAXN];
int res;

int seg[4*MAXN],lazy[4*MAXN];

void operate(int ind1,int ind2,int fi){
    FOR(i,1,n+1){
        if(a[ind1][i] == a[ind2][i]) a[fi][i] = a[ind1][i];
        else if(a[ind1][i] != 0 and a[ind2][i] != 0) a[fi][i] = 0;
        else if(a[ind1][i] != 1 and a[ind2][i] != 1) a[fi][i] = 1;
        else a[fi][i] = 2;
    }
}

void build(int node,int l,int r){
    lazy[node] = -1;
    if(l == r){
        seg[node] = (s[l]==t[l]);
        return;
    }
    int m = (l+r)/2;
    build(2*node,l,m);
    build(2*node+1,m+1,r);
    seg[node] = seg[2*node]+seg[2*node+1];
}

void propogate(int node,int l,int r){
    if(lazy[node] == -1) return;
    seg[node] = pref[r][lazy[node]]-pref[l-1][lazy[node]];
    if(l != r){
        lazy[2*node] = lazy[node];
        lazy[2*node+1] = lazy[node];
    }
    lazy[node] = -1;
}

void update(int node,int l,int r,int x,int y,int val){
    propogate(node,l,r);
    if(x > r or l > y) return;
    if(l >= x and r <= y){
        res += pref[r][val]-pref[l-1][val];
        res -= seg[node];
        lazy[node] = val;
        propogate(node,l,r);
        return;
    }
    int m = (l+r)/2;
    update(2*node,l,m,x,y,val);
    update(2*node+1,m+1,r,x,y,val);
    seg[node] = seg[2*node]+seg[2*node+1];
}
 
void solvethetestcase(){
    cin >> n;
    REP(i,3){
        string cur; cin >> cur;
        REP(j,n){
            if(cur[j] == 'J') a[i][j+1] = 0;
            if(cur[j] == 'O') a[i][j+1] = 1;
            if(cur[j] == 'I') a[i][j+1] = 2;
        }
    }
    cin >> q;
    string cur; cin >> cur;
    REP(i,n){
        if(cur[i] == 'J') t[i+1] = 0;
        if(cur[i] == 'O') t[i+1] = 1;
        if(cur[i] == 'I') t[i+1] = 2;
    }
    FOR(i,1,q+1){
        cin >> quer[i].F.F >> quer[i].F.S;
        char c; cin >> c;
        if(c == 'J') quer[i].S = 0;
        if(c == 'O') quer[i].S = 1;
        if(c == 'I') quer[i].S = 2;
        ans[i] = 0;
    }
    operate(0,1,3);
    operate(0,2,4);
    operate(1,2,5);
    operate(3,2,6);
    operate(4,1,7);
    operate(5,0,8);
    REP(i,9){
        FOR(j,1,n+1){
            s[j] = a[i][j];
            pref[j][0] = pref[j-1][0];
            pref[j][1] = pref[j-1][1];
            pref[j][2] = pref[j-1][2];
            pref[j][s[j]]++;
        }
        build(1,1,n);
        res = seg[1];
        if(res == n) ans[0] = 1;
        FOR(j,1,q+1){
            update(1,1,n,quer[j].F.F,quer[j].F.S,quer[j].S);
            if(res == n) ans[j] = 1;
        }
    }
    REP(i,q+1){
        if(ans[i]) cout << "Yes\n";
        else cout << "No\n";
    }
}

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 384 ms 6740 KB Output is correct
2 Correct 457 ms 7180 KB Output is correct
3 Correct 463 ms 7180 KB Output is correct
4 Correct 326 ms 7008 KB Output is correct
5 Correct 320 ms 6984 KB Output is correct
6 Correct 328 ms 6856 KB Output is correct
7 Correct 336 ms 7116 KB Output is correct
8 Correct 348 ms 7180 KB Output is correct
9 Correct 356 ms 7196 KB Output is correct
10 Correct 342 ms 7180 KB Output is correct
11 Correct 358 ms 7180 KB Output is correct
12 Correct 379 ms 7184 KB Output is correct
13 Correct 387 ms 7188 KB Output is correct
14 Correct 394 ms 7236 KB Output is correct
15 Correct 407 ms 7184 KB Output is correct
16 Correct 374 ms 7164 KB Output is correct
17 Correct 370 ms 7188 KB Output is correct
18 Correct 434 ms 7184 KB Output is correct

Subtask #2
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 384 ms 6740 KB Output is correct
2 Correct 457 ms 7180 KB Output is correct
3 Correct 463 ms 7180 KB Output is correct
4 Correct 326 ms 7008 KB Output is correct
5 Correct 320 ms 6984 KB Output is correct
6 Correct 328 ms 6856 KB Output is correct
7 Correct 336 ms 7116 KB Output is correct
8 Correct 348 ms 7180 KB Output is correct
9 Correct 356 ms 7196 KB Output is correct
10 Correct 342 ms 7180 KB Output is correct
11 Correct 358 ms 7180 KB Output is correct
12 Correct 379 ms 7184 KB Output is correct
13 Correct 387 ms 7188 KB Output is correct
14 Correct 394 ms 7236 KB Output is correct
15 Correct 407 ms 7184 KB Output is correct
16 Correct 374 ms 7164 KB Output is correct
17 Correct 370 ms 7188 KB Output is correct
18 Correct 434 ms 7184 KB Output is correct
19 Correct 2730 ms 37628 KB Output is correct
20 Correct 2009 ms 37632 KB Output is correct
21 Correct 1436 ms 36096 KB Output is correct
22 Correct 1408 ms 33992 KB Output is correct
23 Correct 812 ms 8848 KB Output is correct
24 Correct 748 ms 8824 KB Output is correct
25 Correct 1548 ms 37632 KB Output is correct
26 Correct 1555 ms 37624 KB Output is correct
27 Correct 1805 ms 37628 KB Output is correct
28 Correct 1856 ms 37632 KB Output is correct
29 Correct 1582 ms 36968 KB Output is correct
30 Correct 816 ms 8844 KB Output is correct
31 Correct 1744 ms 37628 KB Output is correct
32 Correct 1864 ms 35692 KB Output is correct
33 Correct 746 ms 8816 KB Output is correct
34 Correct 2197 ms 37632 KB Output is correct
35 Correct 1256 ms 31592 KB Output is correct
36 Correct 791 ms 8816 KB Output is correct
37 Correct 756 ms 8792 KB Output is correct
38 Correct 1551 ms 37628 KB Output is correct
39 Correct 802 ms 37628 KB Output is correct
40 Correct 1291 ms 25992 KB Output is correct
41 Correct 3005 ms 37888 KB Output is correct
42 Correct 139 ms 37868 KB Output is correct

Subtask #3
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 384 ms 6740 KB Output is correct
2 Correct 457 ms 7180 KB Output is correct
3 Correct 463 ms 7180 KB Output is correct
4 Correct 326 ms 7008 KB Output is correct
5 Correct 320 ms 6984 KB Output is correct
6 Correct 328 ms 6856 KB Output is correct
7 Correct 336 ms 7116 KB Output is correct
8 Correct 348 ms 7180 KB Output is correct
9 Correct 356 ms 7196 KB Output is correct
10 Correct 342 ms 7180 KB Output is correct
11 Correct 358 ms 7180 KB Output is correct
12 Correct 379 ms 7184 KB Output is correct
13 Correct 387 ms 7188 KB Output is correct
14 Correct 394 ms 7236 KB Output is correct
15 Correct 407 ms 7184 KB Output is correct
16 Correct 374 ms 7164 KB Output is correct
17 Correct 370 ms 7188 KB Output is correct
18 Correct 434 ms 7184 KB Output is correct
19 Correct 408 ms 6908 KB Output is correct
20 Correct 452 ms 7188 KB Output is correct
21 Correct 348 ms 7184 KB Output is correct
22 Correct 367 ms 6684 KB Output is correct
23 Correct 348 ms 7268 KB Output is correct
24 Correct 345 ms 7136 KB Output is correct
25 Correct 352 ms 7332 KB Output is correct
26 Correct 318 ms 6980 KB Output is correct
27 Correct 379 ms 7296 KB Output is correct
28 Correct 364 ms 6668 KB Output is correct
29 Correct 347 ms 7184 KB Output is correct
30 Correct 322 ms 6756 KB Output is correct
31 Correct 399 ms 7184 KB Output is correct
32 Correct 339 ms 7184 KB Output is correct
33 Correct 394 ms 7184 KB Output is correct
34 Correct 456 ms 6820 KB Output is correct
35 Correct 456 ms 7244 KB Output is correct
36 Correct 362 ms 7184 KB Output is correct
37 Correct 368 ms 7236 KB Output is correct
38 Correct 356 ms 7176 KB Output is correct
39 Correct 385 ms 7216 KB Output is correct
40 Correct 431 ms 7276 KB Output is correct
41 Correct 350 ms 7180 KB Output is correct
42 Correct 358 ms 7196 KB Output is correct
43 Correct 352 ms 7124 KB Output is correct
44 Correct 359 ms 7160 KB Output is correct

Subtask #4
51.0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 384 ms 6740 KB Output is correct
2 Correct 457 ms 7180 KB Output is correct
3 Correct 463 ms 7180 KB Output is correct
4 Correct 326 ms 7008 KB Output is correct
5 Correct 320 ms 6984 KB Output is correct
6 Correct 328 ms 6856 KB Output is correct
7 Correct 336 ms 7116 KB Output is correct
8 Correct 348 ms 7180 KB Output is correct
9 Correct 356 ms 7196 KB Output is correct
10 Correct 342 ms 7180 KB Output is correct
11 Correct 358 ms 7180 KB Output is correct
12 Correct 379 ms 7184 KB Output is correct
13 Correct 387 ms 7188 KB Output is correct
14 Correct 394 ms 7236 KB Output is correct
15 Correct 407 ms 7184 KB Output is correct
16 Correct 374 ms 7164 KB Output is correct
17 Correct 370 ms 7188 KB Output is correct
18 Correct 434 ms 7184 KB Output is correct
19 Correct 2730 ms 37628 KB Output is correct
20 Correct 2009 ms 37632 KB Output is correct
21 Correct 1436 ms 36096 KB Output is correct
22 Correct 1408 ms 33992 KB Output is correct
23 Correct 812 ms 8848 KB Output is correct
24 Correct 748 ms 8824 KB Output is correct
25 Correct 1548 ms 37632 KB Output is correct
26 Correct 1555 ms 37624 KB Output is correct
27 Correct 1805 ms 37628 KB Output is correct
28 Correct 1856 ms 37632 KB Output is correct
29 Correct 1582 ms 36968 KB Output is correct
30 Correct 816 ms 8844 KB Output is correct
31 Correct 1744 ms 37628 KB Output is correct
32 Correct 1864 ms 35692 KB Output is correct
33 Correct 746 ms 8816 KB Output is correct
34 Correct 2197 ms 37632 KB Output is correct
35 Correct 1256 ms 31592 KB Output is correct
36 Correct 791 ms 8816 KB Output is correct
37 Correct 756 ms 8792 KB Output is correct
38 Correct 1551 ms 37628 KB Output is correct
39 Correct 802 ms 37628 KB Output is correct
40 Correct 1291 ms 25992 KB Output is correct
41 Correct 3005 ms 37888 KB Output is correct
42 Correct 139 ms 37868 KB Output is correct
43 Correct 408 ms 6908 KB Output is correct
44 Correct 452 ms 7188 KB Output is correct
45 Correct 348 ms 7184 KB Output is correct
46 Correct 367 ms 6684 KB Output is correct
47 Correct 348 ms 7268 KB Output is correct
48 Correct 345 ms 7136 KB Output is correct
49 Correct 352 ms 7332 KB Output is correct
50 Correct 318 ms 6980 KB Output is correct
51 Correct 379 ms 7296 KB Output is correct
52 Correct 364 ms 6668 KB Output is correct
53 Correct 347 ms 7184 KB Output is correct
54 Correct 322 ms 6756 KB Output is correct
55 Correct 399 ms 7184 KB Output is correct
56 Correct 339 ms 7184 KB Output is correct
57 Correct 394 ms 7184 KB Output is correct
58 Correct 456 ms 6820 KB Output is correct
59 Correct 456 ms 7244 KB Output is correct
60 Correct 362 ms 7184 KB Output is correct
61 Correct 368 ms 7236 KB Output is correct
62 Correct 356 ms 7176 KB Output is correct
63 Correct 385 ms 7216 KB Output is correct
64 Correct 431 ms 7276 KB Output is correct
65 Correct 350 ms 7180 KB Output is correct
66 Correct 358 ms 7196 KB Output is correct
67 Correct 352 ms 7124 KB Output is correct
68 Correct 359 ms 7160 KB Output is correct
69 Correct 2283 ms 33508 KB Output is correct
70 Correct 1999 ms 37644 KB Output is correct
71 Correct 728 ms 8836 KB Output is correct
72 Correct 750 ms 8856 KB Output is correct
73 Correct 707 ms 8900 KB Output is correct
74 Correct 1436 ms 33560 KB Output is correct
75 Correct 741 ms 8808 KB Output is correct
76 Correct 1564 ms 37624 KB Output is correct
77 Correct 1481 ms 33772 KB Output is correct
78 Correct 815 ms 8824 KB Output is correct
79 Correct 746 ms 8844 KB Output is correct
80 Correct 1214 ms 30888 KB Output is correct
81 Correct 776 ms 8808 KB Output is correct
82 Correct 1603 ms 37628 KB Output is correct
83 Correct 1403 ms 36200 KB Output is correct
84 Correct 694 ms 8896 KB Output is correct
85 Correct 707 ms 8880 KB Output is correct
86 Correct 1449 ms 32016 KB Output is correct
87 Correct 1748 ms 37672 KB Output is correct
88 Correct 781 ms 8912 KB Output is correct
89 Correct 1475 ms 34668 KB Output is correct
90 Correct 1690 ms 37656 KB Output is correct
91 Correct 780 ms 8820 KB Output is correct
92 Correct 1215 ms 31680 KB Output is correct
93 Correct 702 ms 8808 KB Output is correct
94 Correct 699 ms 8900 KB Output is correct
95 Correct 717 ms 8828 KB Output is correct
96 Correct 1475 ms 37628 KB Output is correct
97 Correct 747 ms 37680 KB Output is correct
98 Correct 1122 ms 26056 KB Output is correct
99 Correct 2608 ms 37896 KB Output is correct
100 Correct 131 ms 37900 KB Output is correct