제출 #682310

#제출 시각아이디문제언어결과실행 시간메모리
682310vjudge1Building 4 (JOI20_building4)C++17
0 / 100
1 ms340 KiB
#include <bits/stdc++.h> #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> using namespace std; using namespace __gnu_pbds; #pragma GCC optimization("g", on) #pragma GCC optimization("03") #pragma comment(linker, "/stack:200000000") #pragma GCC optimize("Ofast") #pragma GCC optimize("inline") #pragma GCC optimize("-fgcse,-fgcse-lm") #pragma GCC optimize("-ftree-pre,-ftree-vrp") #pragma GCC optimize("-ffast-math") #pragma GCC optimize("-fipa-sra") #pragma GCC optimize("-fpeephole2") #pragma GCC optimize("-fsched-spec") #pragma GCC optimize("Ofast,no-stack-protector") #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native") #pragma GCC optimize("unroll-loops") #define aboba ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); #define br break; #define sp " " #define en "\n" #define pb push_back #define sz size() #define bg begin() #define ed end() #define in insert #define ss second #define ff first #define rbg rbegin() #define setp(a) cout << fixed; cout << setprecision(a); #define all(v) v.begin(), v.end() typedef long long ll; typedef long double ld; typedef pair<ll, ll> pll; typedef double db; typedef tree< long long, null_type, less_equal<long long>, rb_tree_tag, tree_order_statistics_node_update> orset; void freopen(string s) { freopen((s + ".in").c_str(), "r", stdin); freopen((s + ".out").c_str(), "w", stdout); } ll bp(ll x, ll y, ll z) { ll res = 1; while (y) { if (y & 1) { res = (res * x) % z; y--; } x = (x * x) % z; y >>= 1; } return res; } // C(n, k) = ((fact[n] * bp(fact[k], mod - 2)) % mod * bp(fact[n - k], mod - 2)) % mod; ll lcm(ll a, ll b) { return (a / __gcd(a, b)) * b; } const ll N = 1e6 + 11; const ll inf = 1e9 + 7; ll tt = 1; ll a[N], b[N], p[N]; void solve() { ll n; cin >> n; n *= 2; for (int i = 1;i <= n;i++) cin >> a[i]; for (int i = 1;i <= n;i++) cin >> b[i]; for (int i = 0;i < (1 << n);i++) { if (__builtin_popcount(i) != n / 2) continue; string s = ""; ll last = -1; bool f = 0; for (int j = 0;j < n;j++) { if (i & (1 << j)) { if (a[j + 1] < last) { f = 1; br; } last = a[j + 1]; s += 'A'; } else { if (b[j + 1] < last) { f = 1; br; } last = b[j + 1]; s += 'B'; } } if (!f) { cout << s << en; return; } } cout << -1 << en; } int main() { aboba //freopen("numbers"); //freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout); //cin >> tt; for (int i = 1;i <= tt;i++) { solve(); } }

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

building4.cpp:7: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    7 | #pragma GCC optimization("g", on)
      | 
building4.cpp:8: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    8 | #pragma GCC optimization("03")
      | 
building4.cpp:9: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
    9 | #pragma comment(linker, "/stack:200000000")
      | 
building4.cpp: In function 'void freopen(std::string)':
building4.cpp:48:33: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   48 | void freopen(string s) { freopen((s + ".in").c_str(), "r", stdin); freopen((s + ".out").c_str(), "w", stdout); }
      |                          ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
building4.cpp:48:75: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   48 | void freopen(string s) { freopen((s + ".in").c_str(), "r", stdin); freopen((s + ".out").c_str(), "w", stdout); }
      |                                                                    ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...