#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;
}
for (ll i = 1; i <= n; i++)
{
for (ll j = i + 1; j <= n; j++)
{
cout << 2 << ' ' << i << ' ' << j << endl;
ll suit; cin >> suit;
if (suit == 1) U(i, j);
}
}
unordered_map <ll, ll> occ;
vector <ll> vec;
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 < n; i++)
{
occ[vec[i]] = i + 1;
}
cout << 0 << ' ';
for (ll i = 1; i <= n; i++)
{
cout << occ[F(i)] << ' ';
}
cout << endl;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
42 ms |
280 KB |
Integer 34 violates the range [1, 11] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
82 ms |
284 KB |
Integer 26 violates the range [1, 5] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
73 ms |
284 KB |
Integer 6 violates the range [1, 1] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
59 ms |
288 KB |
Integer 22 violates the range [1, 4] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
106 ms |
288 KB |
Integer 20 violates the range [1, 2] |
2 |
Halted |
0 ms |
0 KB |
- |