oj.uz

Submission #792790

# Submission time Handle Problem Language Result Execution time Memory
792790 2023-07-25T08:47:33 Z bachhoangxuan 복사 붙여넣기 2 (JOI15_copypaste2) C++17
100 / 100
 168 ms 10828 KB 
// Judges with GCC >= 12 only needs Ofast
// #pragma GCC optimize("O3,no-stack-protector,fast-math,unroll-loops,tree-vectorize")
// MLE optimization
// #pragma GCC optimize("conserve-stack")
// Old judges
// #pragma GCC target("sse4.2,popcnt,lzcnt,abm,mmx,fma,bmi,bmi2")
// New judges. Test with assert(__builtin_cpu_supports("avx2"));
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
// Atcoder
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma")
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
- insert(x),erase(x)
- find_by_order(k): return iterator to the k-th smallest element
- order_of_key(x): the number of elements that are strictly smaller
*/
#include<bits/stdc++.h>
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
uniform_real_distribution<> pp(0.0,1.0);
#define int long long
#define ld long double
#define pii pair<int,int>
#define piii pair<int,pii>
#define mpp make_pair
#define fi first
#define se second
const int inf=1e18;
const int mod=998244353;
const int maxn=200005;
const int bl=650;
const int maxs=655;
const int maxm=200005;
const int maxq=500005;
const int maxl=20;
const int maxa=250000;
const int root=3;
int power(int a,int n){
    int res=1;
    while(n){
        if(n&1) res=res*a%mod;
        a=a*a%mod;n>>=1;
    }
    return res;
}
const int iroot=power(3,mod-2);
const int base=101;

void solve(){
    int k,m;cin >> k >> m;
    string s;cin >> s;
    int n;cin >> n;
    vector<piii> d(n);
    for(int i=n-1;i>=0;i--) cin >> d[i].se.fi >> d[i].se.se >> d[i].fi;
    for(int i=0;i<k;i++){
        int c=i;
        for(auto [p,x]:d){
            int len=x.se-x.fi;
            if(c>=p+len) c-=len;
            else if(c>=p) c+=x.fi-p;
        }
        cout << s[c];
    }
    cout << '\n';
}
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
    int test=1;//cin >> test;
    while(test--) solve();
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 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 364 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 336 KB Output is correct

Subtask #2
90.0 / 90.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 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 364 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 113 ms 10828 KB Output is correct
10 Correct 111 ms 10828 KB Output is correct
11 Correct 89 ms 10820 KB Output is correct
12 Correct 113 ms 10800 KB Output is correct
13 Correct 87 ms 10792 KB Output is correct
14 Correct 86 ms 10788 KB Output is correct
15 Correct 89 ms 10708 KB Output is correct
16 Correct 102 ms 10712 KB Output is correct
17 Correct 168 ms 10520 KB Output is correct
18 Correct 56 ms 10768 KB Output is correct
19 Correct 46 ms 10772 KB Output is correct
20 Correct 50 ms 10776 KB Output is correct
21 Correct 51 ms 10772 KB Output is correct
22 Correct 57 ms 10772 KB Output is correct
23 Correct 60 ms 10768 KB Output is correct
24 Correct 70 ms 10700 KB Output is correct
25 Correct 92 ms 10772 KB Output is correct
26 Correct 116 ms 10784 KB Output is correct