제출 #1014387

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1014387		guymmk	크레이피쉬 글쓰는 기계 (IOI12_scrivener)	C++14	0 / 100	17 ms	2404 KiB

scrivener

 #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
 using namespace std;
using namespace __gnu_pbds;
#pragma GCC optimize("O3,Ofast,unroll-loops")
#pragma GCC target("avx2,sse3,sse4,avx")
#define ll long long
#define ull unsigned long long
#define endl '\n'
#define vi vector<int>
#define vpii vector<pair<int,int> >
#define umap unordered_map
#define uset unordered_set
#define mk make_pair
#define pb push_back
#define pob pop_back
#define all(x) x.begin(),x.end()
#define allr(x) x.rbegin(),x.rend()
#define read(x) for (auto& zu: (x)) cin >> zu;
#define F first
#define S second
#define mustawa ios::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr)
#define pii pair<int,int>
#define mishari main
template<class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<class T> using ordered_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;
const int inf=1e9+7;
void fa(bool ok){ cout << (ok ? "Yes": "No") << "\n";}
int pw(int a,int b,int mod=inf){
    int res=1;
    while(b){
        if(b&1){
            res=(res*a)%mod;
        }a=(a*a)%mod;
        b>>=1;
    }return res;
}string s;
int i;
void Init(){
    return;
}
void TypeLetter(char L){
    s+=L;
}
void UndoCommands(int U){
    i++;
    s[i]=s[i-U];
}
char GetLetter(int P){
    return s[P-1];
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 7
• Subtask 3: 0 / 22
• Subtask 4: 0 / 26
• Subtask 5: 0 / 40