oj.uz

답안 #501801

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
501801 2022-01-04T15:27:37 Z Carmel_Ab1 Speedrun (RMI21_speedrun) C++17
100 / 100
 139 ms 1000 KB 
/*
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
 */
#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 outfl(x){cout << x << endl;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;
}



#include "speedrun.h"

vvi g;
vi ord;
void set1(int i,int x){
    for(int j=0; j<10; j++)
        if(x&(1<<j))
            setHint(i,j+1,1);
}
void set2(int i,int x){
    for(int j=0; j<10; j++)
        if(x&(1<<j))
            setHint(i,j+10+1,1);
}

void dfsp(int src,int par){
    if(par!=-1)
        set2(src,par);
    ord.pb(src);
    for(int nbr:g[src])
        if(nbr!=par)
            dfsp(nbr,src);
}
void assignHints(int subtask, int n, int A[], int B[]) {
    g.resize(n+1);
    for(int i=1; i<n; i++){
        g[A[i]].pb(B[i]);
        g[B[i]].pb(A[i]);
    }

    setHintLen(20);
    dfsp(1,-1);

    set2(1,ord.back());
    for(int i=0; i<n; i++){
        set1(ord[i],ord[(i+1)%ord.size()]);
    }
}

int get(int ix){
    int ans=0;
    for(int i=0; i<10; i++)
        if(getHint(1+i+10*ix))
            ans+=(1<<i);
    return ans;
}

stack<int>nxt;
vector<bool>vis;
void dfs(int src,int par){
    int cnxt=get(0),cprv=get(1);
    vis[src]=1;
    bool first=1;

    while(1){
        bool ok=0;
        bool r=(vis[cnxt]?1:goTo(cnxt));
        if(!vis[cnxt] && r) {
            dfs(cnxt, src);
            if(!nxt.size())
                break;
            cnxt=nxt.top();
            ok=1;
        }
        else if(!r && first){
            nxt.push(cnxt);
            break;
        }
        while(nxt.size() && !vis[nxt.top()] && goTo(nxt.top())){
            int t=nxt.top();
            nxt.pop();
            dfs(t,src);
            ok=1;
        }
        first=0;
        if(!ok)break;
    }
    if(!vis[cprv] && goTo(cprv))
        dfs(cprv,src);
    if(par!=-1)
        goTo(par);
}

void speedrun(int subtask, int N, int start) {
    vis.resize(N+1);
    dfs(start,-1);
    bool ok=1;
}
/*
5
1 2
1 3
3 4
3 5

5
1 2
1 3
1 4
1 5

7
1 2
1 3
2 4
2 5
3 6
3 7

18
1 2
1 3
2 4
2 5
3 6
3 7
5 8
6 9
6 10
1 11
3 12
12 13
8 14
14 15
15 16
16 17
1 18
 */

Compilation message

speedrun.cpp: In function 'void speedrun(int, int, int)':
speedrun.cpp:153:10: warning: unused variable 'ok' [-Wunused-variable]
  153 |     bool ok=1;
      |          ^~
speedrun.cpp: In function 'void usaco(std::string)':
speedrun.cpp:47:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   47 |     freopen(FIN, "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~
speedrun.cpp:48:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   48 |     freopen(FOUT, "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~

Subtask #1
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 121 ms 668 KB Output is correct
2 Correct 108 ms 1000 KB Output is correct
3 Correct 120 ms 760 KB Output is correct
4 Correct 119 ms 708 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 125 ms 736 KB Output is correct
2 Correct 99 ms 708 KB Output is correct

Subtask #3
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 105 ms 1000 KB Output is correct
2 Correct 108 ms 732 KB Output is correct
3 Correct 132 ms 800 KB Output is correct

Subtask #4
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 109 ms 876 KB Output is correct
2 Correct 102 ms 808 KB Output is correct
3 Correct 114 ms 860 KB Output is correct
4 Correct 101 ms 684 KB Output is correct
5 Correct 139 ms 812 KB Output is correct
6 Correct 84 ms 692 KB Output is correct

Subtask #5
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 134 ms 704 KB Output is correct
2 Correct 111 ms 668 KB Output is correct
3 Correct 57 ms 804 KB Output is correct
4 Correct 64 ms 748 KB Output is correct
5 Correct 64 ms 660 KB Output is correct
6 Correct 112 ms 752 KB Output is correct
7 Correct 92 ms 720 KB Output is correct