oj.uz

답안 #660685

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
660685 2022-11-22T19:18:23 Z BidoTeima Poklon (COCI17_poklon7) C++17
0 / 120
 49 ms 94336 KB 
/*
ID: BidoTeima
LANG: C++11
TASK: 
*/
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
void moo(string filename);
void ACPLS(string str = "")
{
    if(str=="NOF")return;
    if(str.size())
        moo(str);
    else{
        #ifndef ONLINE_JUDGE
            freopen("output.txt", "w", stdout);
            freopen("input.txt", "r", stdin);
        #endif
    }
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
}
void moo(string fileName){
    freopen((fileName+".in").c_str(),"r",stdin);
    freopen((fileName+".out").c_str(),"w",stdout);
}
#define tc         \
    int tttttt/*,subtask*/;    \
    cin >> tttttt/* >> subtask*/; \
    while (tttttt--)/*end
*/
pair<string,string>adjW[(int)1e6+5];
pair<int,int>adj[(int)1e6+5]; 
string sum[(int)1e6+5]; 
string binary(int x){ 
    string ret;
    if(x<0)x=-x;
    if(!x)return "0";
    while(x){
        ret.push_back('0'+(x%2));
        x/=2;
    }
    reverse(ret.begin(),ret.end());
    return ret;
}
string mul2(string a){ 
    if(a=="0")return "0";
    a.push_back('0');
    return a;
}
string mx(string&a,string&b){
    if(a.size()>b.size())return a;
    if(b.size()>a.size())return b;
    for(int i = 0; i < (int)a.size(); i++){
        if(a[i]=='1'&&b[i]=='0')return a;
        if(a[i]=='0'&&b[i]=='1')return b;
    }
    return a;
}
string dfs(ll node){
    string x = \
    adj[node].first<=0?
    adjW[node].first:
    dfs(adj[node].first);
    string y = \
    adj[node].second<=0?
    adjW[node].second:
    dfs(adj[node].second);
    return sum[node]=mul2(mx(x,y));
}
int main()
{
    ACPLS();   
    int n;
    cin>>n;
    for(int i = 1; i <= n; i++){
        ll u,v;
        cin>>u>>v;
        adjW[i].first=(binary(u));
        adjW[i].second=(binary(v)); 
        adj[i].first=(u);
        adj[i].second=(v);
    }
    dfs(1);
    cout<<sum[1];
}

Compilation message

poklon.cpp: In function 'void ACPLS(std::string)':
poklon.cpp:17:20: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   17 |             freopen("output.txt", "w", stdout);
      |             ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
poklon.cpp:18:20: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   18 |             freopen("input.txt", "r", stdin);
      |             ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
poklon.cpp: In function 'void moo(std::string)':
poklon.cpp:26:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   26 |     freopen((fileName+".in").c_str(),"r",stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
poklon.cpp:27:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   27 |     freopen((fileName+".out").c_str(),"w",stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 120.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 43 ms 94284 KB Output isn't correct
2 Incorrect 47 ms 94284 KB Output isn't correct
3 Incorrect 43 ms 94316 KB Output isn't correct
4 Incorrect 45 ms 94324 KB Output isn't correct
5 Incorrect 47 ms 94208 KB Output isn't correct
6 Incorrect 43 ms 94252 KB Output isn't correct
7 Incorrect 44 ms 94320 KB Output isn't correct
8 Incorrect 46 ms 94252 KB Output isn't correct
9 Incorrect 43 ms 94232 KB Output isn't correct
10 Incorrect 42 ms 94280 KB Output isn't correct
11 Incorrect 42 ms 94292 KB Output isn't correct
12 Incorrect 43 ms 94216 KB Output isn't correct
13 Incorrect 45 ms 94276 KB Output isn't correct
14 Incorrect 42 ms 94204 KB Output isn't correct
15 Incorrect 43 ms 94316 KB Output isn't correct
16 Incorrect 45 ms 94220 KB Output isn't correct
17 Incorrect 43 ms 94284 KB Output isn't correct
18 Incorrect 47 ms 94336 KB Output isn't correct
19 Incorrect 43 ms 94292 KB Output isn't correct
20 Incorrect 49 ms 94196 KB Output isn't correct