oj.uz

Submission #574788

# Submission time Handle Problem Language Result Execution time Memory
574788 2022-06-09T11:59:30 Z AbdullahMW Carnival (CEOI14_carnival) C++14
20 / 100
 99 ms 336 KB 
#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
 
#if __cplusplus >= 201103L
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>
#endif
 
// C++
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
 
#if __cplusplus >= 201103L
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <typeindex>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#endif
 
#define all(vec) vec.begin(), vec.end()
#define ll long long
#define db double
#define pb push_back
#define pf push_front
#define newl "\n"
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define f first
#define s second
#define MOD 1000000007
 
using namespace std;
 
#pragma GCC diagnostic ignored "-Wunused-result"
void setIO(string name = "") {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cout << fixed << setprecision(15);
    if (name.size()) {
        freopen((name+".in").c_str(), "r", stdin);
        freopen((name+".out").c_str(), "w", stdout);
    }
}


ll p[205], sz[205];
ll F(ll x)
{
    if (x == p[x]) return x;
    else return p[x] = F(p[x]);
}

void U(ll x, ll y)
{
    x = F(x);
    y = F(y);
    
    if (x != y)
    {
        if (sz[x] < sz[y]) swap(x, y);
        
        sz[x] += sz[y];
        p[y] = x; 
    }
}
int main()
{
    //fast
    //setIO("");
    
    ll n; cin >> n;
    
    for (ll i = 1; i <= n; i++)
    {
        sz[i] = 1;
        p[i] = i;
    }
    
    bool used[205][205];
    for (ll i = 1; i <= n; i++)
    {
        for (ll j = i + 1; j <= n; j++)
        {
            if (!used[F(i)][F(j)] && !used[F(j)][F(i)])
            {
                used[F(i)][F(j)] = true;
                used[F(j)][F(i)] = true;
                cout << 2 << ' ' << i << ' ' << j << endl;
                ll suit; cin >> suit;
                if (suit == 1) U(i, j);
            }
        }
    }
    
    vector <ll> vec, occ(205);
    vector <bool> tkn(205);
    for (ll i = 1; i <= n; i++) 
    {
        if (!tkn[F(i)])
        {
            vec.pb(F(i));
            tkn[F(i)] = true;
        }
    }
    
    sort(all(vec));
    occ[vec[0]] = 1;
    for (ll i = 1; i < vec.size(); i++) occ[vec[i]] = i + 1;
    
    
    cout << 0 << ' ';
    for (ll i = 1; i <= n; i++) cout << occ[F(i)] << ' ';
    cout << endl;
}

Compilation message

carnival.cpp: In function 'int main()':
carnival.cpp:173:22: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  173 |     for (ll i = 1; i < vec.size(); i++) occ[vec[i]] = i + 1;
      |                    ~~^~~~~~~~~~~~

Subtask #1
4.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 336 KB Output is correct
2 Correct 14 ms 336 KB Output is correct
3 Partially correct 52 ms 336 KB Partially correct
4 Partially correct 70 ms 336 KB Partially correct
5 Correct 3 ms 336 KB Output is correct
6 Correct 2 ms 336 KB Output is correct
7 Correct 17 ms 336 KB Output is correct

Subtask #2
4.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 336 KB Output is correct
2 Correct 16 ms 336 KB Output is correct
3 Partially correct 15 ms 316 KB Partially correct
4 Partially correct 80 ms 336 KB Partially correct
5 Correct 4 ms 336 KB Output is correct
6 Correct 3 ms 208 KB Output is correct
7 Correct 7 ms 336 KB Output is correct

Subtask #3
4.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 336 KB Output is correct
2 Correct 6 ms 208 KB Output is correct
3 Partially correct 41 ms 336 KB Partially correct
4 Partially correct 82 ms 336 KB Partially correct
5 Correct 6 ms 336 KB Output is correct
6 Correct 8 ms 336 KB Output is correct
7 Correct 23 ms 336 KB Output is correct

Subtask #4
4.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 336 KB Output is correct
2 Correct 4 ms 336 KB Output is correct
3 Partially correct 78 ms 336 KB Partially correct
4 Partially correct 88 ms 336 KB Partially correct
5 Correct 11 ms 336 KB Output is correct
6 Correct 26 ms 336 KB Output is correct
7 Correct 17 ms 336 KB Output is correct

Subtask #5
4.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 208 KB Output is correct
2 Correct 12 ms 336 KB Output is correct
3 Partially correct 45 ms 336 KB Partially correct
4 Partially correct 59 ms 336 KB Partially correct
5 Correct 25 ms 336 KB Output is correct
6 Partially correct 56 ms 336 KB Partially correct
7 Partially correct 99 ms 336 KB Partially correct