Submission #851289

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
851289	2023-09-19T11:33:41 Z	hariaakas646	Poklon (COCI17_poklon7)	C++17	96 / 120	1000 ms	262144 KB

poklon

#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;
    // }
}

Compilation message

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);
      |         ^~~

Subtask #1

96.0 / 120.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	344 KB	Output is correct
3	Correct	0 ms	344 KB	Output is correct
4	Correct	0 ms	500 KB	Output is correct
5	Correct	1 ms	344 KB	Output is correct
6	Correct	1 ms	344 KB	Output is correct
7	Correct	1 ms	344 KB	Output is correct
8	Correct	1 ms	344 KB	Output is correct
9	Correct	1 ms	344 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	6 ms	1880 KB	Output is correct
12	Correct	7 ms	1368 KB	Output is correct
13	Correct	38 ms	8024 KB	Output is correct
14	Correct	109 ms	16464 KB	Output is correct
15	Correct	44 ms	1112 KB	Output is correct
16	Correct	503 ms	39760 KB	Output is correct
17	Execution timed out	1043 ms	81556 KB	Time limit exceeded
18	Execution timed out	1039 ms	94288 KB	Time limit exceeded
19	Execution timed out	1036 ms	60240 KB	Time limit exceeded
20	Runtime error	331 ms	262144 KB	Execution killed with signal 9