oj.uz

답안 #469758

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
469758 2021-09-01T17:43:54 Z Carmel_Ab1 사육제 (CEOI14_carnival) C++17
100 / 100
 29 ms 472 KB 
#include<bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

//using namespace __gnu_pbds;
using namespace std;

typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef vector<pl> vpl;
typedef vector<ld> vld;
typedef pair<ld, ld> pld;

//typedef tree<ll, null_type, less_equal<ll>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
template<typename T>
ostream &operator<<(ostream &os, vector<T> &a) {
    os << "[";
    for (int i = 0; i < ll(a.size()); i++) { os << a[i] << ((i != ll(a.size() - 1) ? " " : "")); }
    os << "]\n";
    return os;
}

#define all(x) x.begin(),x.end()
#define YES out("YES")
#define NO out("NO")
#define out(x){cout << x << "\n"; return;}
#define GLHF ios_base::sync_with_stdio(false); cin.tie(NULL)
#define print(x){for(auto ait:x) cout << ait << " "; cout << "\n";}
#define pb push_back
#define umap unordered_map

template<typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
    is >> p.first >> p.second;
    return is;
}

template<typename T1, typename T2>
ostream &operator<<(ostream &os, pair<T1, T2> &p) {
    os << "" << p.first << " " << p.second << "";
    return os;
}

void usaco(string taskname) {
    string fin = taskname + ".in";
    string fout = taskname + ".out";
    const char *FIN = fin.c_str();
    const char *FOUT = fout.c_str();
    freopen(FIN, "r", stdin);
    freopen(FOUT, "w", stdout);
}

template<typename T>
void read(vector<T> &v) {
    int n = v.size();
    for (int i = 0; i < n; i++)
        cin >> v[i];
}

template<typename T>
vector<T> UNQ(vector<T> a) {
    vector<T> ans;
    for (T t:a)
        if (ans.empty() || t != ans.back())
            ans.push_back(t);
    return ans;
}

ll ceil(ll a, ll b) {
    ll ans = a / b;
    if (a % b)ans++;
    return ans;
}

ld log(ld a, ld b) { return log(b) / log(a); }

ll power(ll base, ll exp, ll M = 1e18) {//(base^exp)%M
    ll ans = 1;
    while (exp) {
        if (exp % 2 == 1)ans = ((ans % M) * (base % M)) % M;
        base = ((base % M) * (base % M)) % M;
        exp /= 2;
    }
    return ans;
}

string to_base(int n, int new_base) {
    string s;
    int nn = n;
    while (nn) {
        s += to_string(nn % new_base);
        nn /= new_base;
    }
    reverse(all(s));
    return s;
}

ll gcd(ll a, ll b) {
    if (a < b)swap(a, b);
    if (b == 0)return a;
    return gcd(b, a % b);
}

ll lcm(ll a, ll b) {
    ll x = (a / gcd(a, b));
    return b * x;
}

vl generate_array(ll n, ll mn = 1, ll mx = 1e18 + 1) {
    if (mx == 1e18 + 1)
        mx = n;
    vl ans(n);
    for (int i = 0; i < n; i++)
        ans[i] = (mn + rand() % (mx - mn + 1));
    return ans;
}

string substr(string s, int l, int r) {
    string ans;
    for (int i = l; i <= r; i++)
        ans += s[i];
    return ans;
}


void solve();

int main() {
    GLHF;
    int t = 1;
    //cin >> t;
    while (t--)
        solve();
}
vi par;
int get(int x){return par[x]=(x==par[x]?x:get(par[x]));}
void unite(int u,int v){
    u=get(u),v=get(v);
    if(u==v)return;
    if(u>v)swap(u,v);
    par[v]=u;
}
map<vi,int>vis;
int ask(vi a){
    if(!a.size())return 0;

    sort(all(a));
    a=UNQ(a);
    if(a.size()==1)return 1;

    if(vis.count(a))
        return vis[a];
    cout << a.size() << " " ;
    for(int i=0; i<a.size(); i++)
        cout << a[i] << " ";
    cout << endl;
    int ans;
    cin >> ans;
    return vis[a]=ans;
}

void solve() {
    int n;
    cin >> n;
    par.resize(n+1);
    for(int i=1; i<=n; i++)
        par[i]=i;
    const ll sz=13;
    vvi who(sz);
    for(int i=1; i<=n; i++)
        who[i%sz].pb(i);
    vl asked(sz);
    for(int i=0; i<sz; i++)
        asked[i]=ask(who[i]);

    for(int i=1; i<=n; i++){
        for(int j=0; j<sz; j++){
            vi tmp=who[j];
            tmp.pb(i);
            bool b=0;
            if(ask(tmp)==asked[j]){
                for(int k:who[j]) {
                    if (ask({i, k}) == 1)
                        unite(i, k), b = 1;
                    if(b)break;
                }
            }
            if(b)break;
        }
    }

    vi ans(n+1);
    for(int i=1; i<=n; i++)
        ans[i]=get(i);
    vvi comps(n+1);
    for(int i=1; i<=n; i++)
        comps[ans[i]].pb(i);

    ll c=1;
    for(vi v:comps){
        if(!v.size())continue;
        for(int i=0; i<v.size(); i++)
            ans[v[i]]=c;
        c++;
    }

    for(int i=0; i<=n; i++)
        cout << ans[i] << " ";
    cout << endl;
}

Compilation message

carnival.cpp: In function 'int ask(vi)':
carnival.cpp:161:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  161 |     for(int i=0; i<a.size(); i++)
      |                  ~^~~~~~~~~
carnival.cpp: In function 'void solve()':
carnival.cpp:209:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  209 |         for(int i=0; i<v.size(); i++)
      |                      ~^~~~~~~~~
carnival.cpp: In function 'void usaco(std::string)':
carnival.cpp:56:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   56 |     freopen(FIN, "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~
carnival.cpp:57:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   57 |     freopen(FOUT, "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 384 KB Output is correct
2 Correct 8 ms 328 KB Output is correct
3 Correct 14 ms 456 KB Output is correct
4 Correct 23 ms 448 KB Output is correct
5 Correct 5 ms 328 KB Output is correct
6 Correct 4 ms 328 KB Output is correct
7 Correct 12 ms 408 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 356 KB Output is correct
2 Correct 16 ms 360 KB Output is correct
3 Correct 11 ms 368 KB Output is correct
4 Correct 21 ms 380 KB Output is correct
5 Correct 7 ms 328 KB Output is correct
6 Correct 7 ms 348 KB Output is correct
7 Correct 11 ms 328 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 328 KB Output is correct
2 Correct 10 ms 328 KB Output is correct
3 Correct 15 ms 444 KB Output is correct
4 Correct 25 ms 448 KB Output is correct
5 Correct 7 ms 372 KB Output is correct
6 Correct 8 ms 328 KB Output is correct
7 Correct 13 ms 416 KB Output is correct

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 340 KB Output is correct
2 Correct 11 ms 380 KB Output is correct
3 Correct 19 ms 440 KB Output is correct
4 Correct 19 ms 436 KB Output is correct
5 Correct 10 ms 388 KB Output is correct
6 Correct 13 ms 328 KB Output is correct
7 Correct 25 ms 424 KB Output is correct

Subtask #5
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 328 KB Output is correct
2 Correct 12 ms 360 KB Output is correct
3 Correct 15 ms 448 KB Output is correct
4 Correct 20 ms 456 KB Output is correct
5 Correct 15 ms 312 KB Output is correct
6 Correct 14 ms 372 KB Output is correct
7 Correct 29 ms 472 KB Output is correct