제출 #490461

#제출 시각아이디문제언어결과실행 시간메모리
490461MohamedAliSaidaneHandcrafted Gift (IOI20_gift)C++14
0 / 100
1 ms204 KiB
#include <bits/stdc++.h> #include "gift.h" using namespace std; typedef long long ll; typedef unsigned long long ull; typedef long double ld; typedef pair<int,int> pii; typedef pair<ll,ll> pll; typedef pair<ld,ld> pld; typedef vector<int> vi; typedef vector<ll> vll; typedef vector<pii> vpi; typedef vector<pll> vpl; typedef vector<pld> vpd; #define pb push_back #define popb pop_back #define all(v) (v).begin(),(v).end() #define ff first #define ss second const ll MOD = 1e9 + 7; const ll INF = 1e18; int nx[4] = {1,-1,0,0}, ny[4] = {0,0,1,-1}; /////// SOLUTION \\\\\\\ int n, r; vi a, b, x; vi p, rnk; int findset(int x){return p[x] == x? x: findset(p[x]);} void unite(int i, int j) { int x= findset(i); int y = findset(j); if(x == y) return ; if(rnk[x] > rnk[y]) swap(x,y); if(rnk[x] == rnk[y]) rnk[y]++; p[x]= y; return; } int construct(int n, int r, vi a, vi b, vi x) { vpi same; vpi diff; map<int,int> s; map<int,int> d; string res = ""; for(int i= 0; i <n; i ++) { s[i]= i; res += 'R'; } for(int i= 0; i <r; i ++) { if(x[i] == 1) { same.pb({a[i],b[i]}); s[a[i]] = max(s[a[i]],b[i]); } else { diff.pb({a[i],b[i]}); d[a[i]] = max(d[a[i]],b[i]); } } char c= 'R'; for(int i = 0; i < n; i ++) { int r = s[i]; for(int u = i; u <= r; u ++) { r = max(r,s[u]); res[u] = c; } c = c == 'R'? 'B': 'R'; i = r + 1; } int pref[n]; pref[0] = 0; for(int i= 1; i<n; i ++) pref[i] = pref[i-1] + res[i] != res[i-1]; for(auto e: diff) { if(pref[e.ss] - pref[e.ff] <= 1) return 0; } craft(res); return 1; }

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

gift.cpp:27:1: warning: multi-line comment [-Wcomment]
   27 | /////// SOLUTION \\\\\\\
      | ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...