| # | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 574883 | 2022-06-09T12:44:09 Z | Dos | Carnival (CEOI14_carnival) | C++14 | 0 ms | 0 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 int long long;
typedef long long ll;
using namespace std;
const int M = 31;
//#define int ll
int main(){
int n;
cin >> n;
int ans[n+1];
for(int i = 0; i <= n; i++)
{
ans[i] = -1;
}
ans[0] = 0;
for(int i = 1; i <= n; i++)
{
if(ans[i] != -1)
{
continue;
}
ans[i] = ans[i-1] + 1;
for(int j = i + 1; j <= n; j++)
{
cout << 2 << " " << i << " " << j << endl;
cout << endl;
int x;
cin >> x;
if(x == 1)
{
ans[j] = ans[i];
}
}
}
cout << 0 << " ";
for(int i = 1; i <= n; i++)
{
cout << ans[i] << " ";
coutf.flush();
}
//cout << endl;
return 0;
}
//1 4 5 2 3