제출 #484508

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
484508		Carmel_Ab1	크레이피쉬 글쓰는 기계 (IOI12_scrivener)	C++17	컴파일 에러	0 ms	0 KiB

scrivener

#include<bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

//using namespace __gnu_pbds;
using namespace std;

typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef vector<pl> vpl;
typedef vector<ld> vld;
typedef pair<ld, ld> pld;
typedef vector<pi> vpi;

//typedef tree<ll, null_type, less_equal<ll>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
template<typename T>
ostream &operator<<(ostream &os, vector<T> &a) {
    os << "[";
    for (int i = 0; i < ll(a.size()); i++) { os << a[i] << ((i != ll(a.size() - 1) ? " " : "")); }
    os << "]\n";
    return os;
}

#define all(x) x.begin(),x.end()
#define YES out("YES")
#define NO out("NO")
#define out(x){cout << x << "\n"; return;}
#define GLHF ios_base::sync_with_stdio(false); cin.tie(NULL);cout.tie(NULL)
#define print(x){for(auto ait:x) cout << ait << " "; cout << "\n";}
#define pb push_back
#define umap unordered_map

template<typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
    is >> p.first >> p.second;
    return is;
}

template<typename T1, typename T2>
ostream &operator<<(ostream &os, pair<T1, T2> &p) {
    os << "" << p.first << " " << p.second << "";
    return os;
}

void usaco(string taskname) {
    string fin = taskname + ".in";
    string fout = taskname + ".out";
    const char *FIN = fin.c_str();
    const char *FOUT = fout.c_str();
    freopen(FIN, "r", stdin);
    freopen(FOUT, "w", stdout);
}

template<typename T>
void read(vector<T> &v) {
    int n = v.size();
    for (int i = 0; i < n; i++)
        cin >> v[i];
}

template<typename T>
vector<T> UNQ(vector<T> a) {
    vector<T> ans;
    for (T t: a)
        if (ans.empty() || t != ans.back())
            ans.push_back(t);
    return ans;
}

ll ceil(ll a, ll b) {
    ll ans = a / b;
    if (a % b)ans++;
    return ans;
}

ld log(ld a, ld b) { return log(b) / log(a); }

ll power(ll base, ll exp, ll M = 1e18) {//(base^exp)%M
    ll ans = 1;
    while (exp) {
        if (exp % 2 == 1)ans = ((ans % M) * (base % M)) % M;
        base = ((base % M) * (base % M)) % M;
        exp /= 2;
    }
    return ans;
}

string to_base(int n, int new_base) {
    string s;
    int nn = n;
    while (nn) {
        s += to_string(nn % new_base);
        nn /= new_base;
    }
    reverse(all(s));
    return s;
}

ll gcd(ll a, ll b) {
    if (a < b)swap(a, b);
    if (b == 0)return a;
    return gcd(b, a % b);
}

ll lcm(ll a, ll b) {
    ll x = (a / gcd(a, b));
    return b * x;
}

vl generate_array(ll n, ll mn = 1, ll mx = 1e18 + 1) {
    if (mx == 1e18 + 1)
        mx = n;
    vl ans(n);
    for (int i = 0; i < n; i++)
        ans[i] = (mn + rand() % (mx - mn + 1));
    return ans;
}

string substr(string s, int l, int r) {
    string ans;
    for (int i = l; i <= r; i++)
        ans += s[i];
    return ans;
}


void solve();

int main() {
    GLHF;
    int t = 1;
    //cin >> t;
    while (t--)
        solve();
}

string s;
vi prv,sz;
int timer=0;
vvi dp;

int lst=-1;

void add_row(){
    int cur=timer-1;
    if(s[cur]==' ')
        dp[cur][0]=dp[prv[cur]][0];
    else
        dp[cur][0]=(cur?prv[cur-1]:-1);
    for(int j=1; j<20; j++)
        if(dp[cur][j-1]!=-1)
            dp[cur][j]=dp[dp[cur][j-1]][j-1];
}
void T(char c){
    s+=c;
    prv.pb(timer);
    sz.pb(sz.empty()?1:sz.back()+1);
    timer++;

    add_row();
    lst=timer-1;
}
void U(int x){
    prv.pb(prv[timer-x-1]);
    sz.pb(sz[timer-x-1]);
    timer++;
    s+=' ';
    add_row();
}
string t;

void make_t(){
    t="";
    int cur=timer-1;
    while(0<=cur){
        if(s[cur]!=' ')
            t+=s[cur];
        if(cur==prv[cur])
            cur--;
        else
            cur=prv[cur];
    }
    reverse(all(t));
}

int query(int x,int k){
    for(int i=0; i<20; i++)
        if(k&(1<<i))
            x=dp[x][i];
    return x;
}

int P(int x){
    int t=prv[timer-1];
    int l=sz[t];

    return s[query(t,l-x-1)];
}
void solve() {
    int n;
    cin >> n;

    dp.resize(n,vi(20,-1));

    while(n--){
        char op;
        cin >> op;
        if(op=='T'){
            char c;
            cin >> c;
            T(c);
        }
        else if(op=='U'){
            int x;
            cin >> x;
            U(x);
        }
        else{
            int x;
            cin >> x;
            cout << char(P(x)) <<"\n";
        }
    }
    out("")
}
/*
 6
T a
T b
U 1
T c
U 3
P 0
 */

컴파일 시 표준 에러 (stderr) 메시지

scrivener.cpp: In function 'void usaco(std::string)':
scrivener.cpp:57:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   57 |     freopen(FIN, "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~
scrivener.cpp:58:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   58 |     freopen(FOUT, "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~
/usr/bin/ld: /tmp/ccbyuacE.o: in function `main':
scrivener.cpp:(.text.startup+0x0): multiple definition of `main'; /tmp/cctRrbOC.o:grader.cpp:(.text.startup+0x0): first defined here
/usr/bin/ld: /tmp/cctRrbOC.o: in function `main':
grader.cpp:(.text.startup+0x63): undefined reference to `Init()'
/usr/bin/ld: grader.cpp:(.text.startup+0xff): undefined reference to `TypeLetter(char)'
/usr/bin/ld: grader.cpp:(.text.startup+0x15f): undefined reference to `UndoCommands(int)'
/usr/bin/ld: grader.cpp:(.text.startup+0x18b): undefined reference to `GetLetter(int)'
collect2: error: ld returned 1 exit status