#include <iostream>
#include <string>
#include <queue>
#include <stack>
#include <algorithm>
#include <math.h>
#include <vector>
#include <cstring>
#include <ctime>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
#include <ctime>
#define fr first
#define sc second
#define MP make_pair
#define PB push_back
#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define lli long long int
#define y1 arayikhalatyan
using namespace std;
lli gcd(lli a, lli b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
lli cg(lli n) {
return n ^ (n >> 1);
}
lli SUM(lli a)
{
return (a * (a + 1) / 2);
}
bool CAN(int x, int y, int n, int m)
{
if (x >= 0 && y >= 0 && x < n && y < m)
{
return true;
}
return false;
}
double her(double x1, double y1, double x2, double y2)
{
return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));
}
string strsum(string a, string b)
{
int p = 0;
string c;
reverse(a.begin(), a.end());
reverse(b.begin(), b.end());
if (b.length() < a.length())
{
for (int i = b.length(); i < a.length(); i++)
{
b += "0";
}
}
else
{
for (int i = a.length(); i < b.length(); i++)
{
a += "0";
}
}
a += "0", b += "0";
for (int i = 0; i < a.length(); i++)
{
c += (a[i] - '0' + b[i] - '0' + p) % 10 + '0';
p = (a[i] + b[i] - '0' - '0' + p) / 10;
}
if (c[c.length() - 1] == '0') c.erase(c.length() - 1, 1);
reverse(c.begin(), c.end());
return c;
}
string strmin(string a, string b)
{
if (a.length() > b.length()) return b;
if (b.length() > a.length()) return a;
for (int i = 0; i < a.length(); i++)
{
if (a[i] > b[i]) return b;
if (b[i] > a[i]) return a;
}
return a;
}
char vow[] = { 'a', 'e', 'i', 'o', 'u' };
int dx[] = { 1, -1, 0, 0 };
int dy[] = { 0, 0, 1, -1 };
const int N = 1e6 + 30;
const lli mod = 1000000007;
int n, ss, mx;
int a[110], pos[110], b[110], c[110];
vector <int> g[110], g1[110], ts;
bool sm, col[110];
void tp()
{
cout << "query ";
for (int i = 1; i <= n; i++)
{
cout << a[i] << " ";
}
cout << endl;
}
void dfs(int v)
{
col[v] = true;
for (auto p : g[v]) if (!col[p]) dfs(p);
ts.PB(v);
}
int main()
{
fastio;
cin >> n;
for (int i = 1; i <= n; i++) cin >> a[i], pos[a[i]] = i;
for (int i = 2; i <= n; i++)
{
for (int j = i - 1; j >= 1; j--)
{
g[j].PB(i);
ss = i;
for (int k = i - 1; k >= j; k--) if (!col[k]) dfs(k);
for (int k = 1; k <= n; k++) col[k] = false;
reverse(ts.begin(), ts.end());
for (auto p : ts) a[pos[p]] = ss--;
tp();
ts.clear();
cin >> sm;
g[j].pop_back();
if (!sm) g[i].PB(j);
for (int k = 1; k <= n; k++) a[pos[k]] = k;
}
}
cout << "end";
cout << endl;
mx = 0;
for (int i = 1; i <= n; i++)
{
for (auto p : g[a[i]])
{
if (!b[pos[p]]) b[pos[p]] = ++mx;
}
if(!b[i])
b[i] = ++mx;
cout << b[i] << " ";
}
cout << endl;
for (int i = 1; i <= n; i++)
{
for (auto p : g[i]) g1[p].PB(i);
}
mx = 0;
for (int i = 1; i <= n; i++)
{
for (auto p : g1[a[i]])
{
if (!c[pos[p]]) c[pos[p]] = ++mx;
}
if (!c[i])
c[i] = ++mx;
}
for (int i = 1; i <= n; i++) c[i] = n - c[i] + 1, cout << c[i] << " ";
return 0;
}
Compilation message
zagonetka.cpp: In function 'std::__cxx11::string strsum(std::__cxx11::string, std::__cxx11::string)':
zagonetka.cpp:57:30: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (int i = b.length(); i < a.length(); i++)
~~^~~~~~~~~~~~
zagonetka.cpp:64:30: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (int i = a.length(); i < b.length(); i++)
~~^~~~~~~~~~~~
zagonetka.cpp:71:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (int i = 0; i < a.length(); i++)
~~^~~~~~~~~~~~
zagonetka.cpp: In function 'std::__cxx11::string strmin(std::__cxx11::string, std::__cxx11::string)':
zagonetka.cpp:84:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (int i = 0; i < a.length(); i++)
~~^~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
248 KB |
Output is correct |
| 2 |
Incorrect |
2 ms |
376 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
11 ms |
248 KB |
not a permutatio |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
380 KB |
not a permutatio |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
41 ms |
332 KB |
not a permutatio |
| 2 |
Halted |
0 ms |
0 KB |
- |
