제출 #851289

#제출 시각아이디문제언어결과실행 시간메모리
851289hariaakas646Poklon (COCI17_poklon7)C++17
96 / 120
1043 ms262144 KiB
#include <bits/stdc++.h>

using namespace std;

#define scd(t) scanf("%d", &t)
#define scld(t) scanf("%ld", &t)
#define sclld(t) scanf("%lld", &t)
#define scc(t) scanf("%c", &t)
#define scs(t) scanf("%s", t)
#define scf(t) scanf("%f", &t)
#define sclf(t) scanf("%lf", &t)
#define forr(i, j, k) for (int i = j; i < k; i++)
#define frange(i, j) forr(i, 0, j)
#define all(cont) cont.begin(), cont.end()
#define mp make_pair
#define pb push_back
#define f first
#define s second
typedef long int li;
typedef unsigned long int uli;
typedef long long int lli;
typedef unsigned long long int ulli;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<lli> vll;
typedef vector<string> vs;
typedef vector<pii> vii;
typedef vector<vi> vvi;
typedef map<int, int> mpii;
typedef set<int> seti;
typedef multiset<int> mseti;
typedef long double ld;

void usaco()
{
    freopen("/media/hariaakash646/785EF1075EF0BF46/CompetitiveProgramming/input.in", "r", stdin);
//    freopen("problem.out", "w", stdout);
}

vii vec;
lli tot = 0;

string m_str(string &x, string &y) {
    if(x.size() > y.size()) return x;
    else if(y.size() > x.size()) return y;
    else return max(x, y);
}

string bin_str(int tot) {
    string out;
    while(tot) {
        if(tot % 2 == 1) {
            out += '1';
        }
        else out += '0';
        tot /= 2;
    }
    reverse(all(out));
    return out;
}

string dfs(int x) {
    string l, r;
    if(vec[x].f > 0) {
        l = dfs(vec[x].f);
    } 
    else l = bin_str(abs(vec[x].f));

    if(vec[x].s > 0) {
        r = dfs(vec[x].s);
    } 
    else r = bin_str(abs(vec[x].s));
    return m_str(l, r) + '0';
}

int main() {
    // usaco();
    int n;
    scd(n);
    vec = vii(n+1);

    forr(i, 1, n+1) {
        int l, r;
        scd(l);
        scd(r);
        vec[i] = mp(l, r);
        // if(l < 0) tot += -l;
        // if(r < 0) tot += -r;
    }
    
    string out = dfs(1);
    cout << out;
    // while(tot) {
    //     if(tot % 2 == 1) {
    //         out += '1';
    //     }
    //     else out += '0';
    //     tot /= 2;
    // }
    // reverse(all(out));
    // bool one = false;
    // for(auto e : out) {
    //     if(e == '1') one = true;
    //     if(one) cout << e;
    // }
}

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

poklon.cpp: In function 'void usaco()':
poklon.cpp:37:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   37 |     freopen("/media/hariaakash646/785EF1075EF0BF46/CompetitiveProgramming/input.in", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
poklon.cpp: In function 'int main()':
poklon.cpp:5:21: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    5 | #define scd(t) scanf("%d", &t)
      |                ~~~~~^~~~~~~~~~
poklon.cpp:80:5: note: in expansion of macro 'scd'
   80 |     scd(n);
      |     ^~~
poklon.cpp:5:21: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    5 | #define scd(t) scanf("%d", &t)
      |                ~~~~~^~~~~~~~~~
poklon.cpp:85:9: note: in expansion of macro 'scd'
   85 |         scd(l);
      |         ^~~
poklon.cpp:5:21: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    5 | #define scd(t) scanf("%d", &t)
      |                ~~~~~^~~~~~~~~~
poklon.cpp:86:9: note: in expansion of macro 'scd'
   86 |         scd(r);
      |         ^~~
#Verdict Execution timeMemoryGrader output
Fetching results...