Submission #1094617

#TimeUsernameProblemLanguageResultExecution timeMemory
1094617crafticatArt Collections (BOI22_art)C++17
0 / 100
1 ms344 KiB
#include "bits/stdc++.h" using namespace std; template<typename T> using V = vector<T>; using vi = V<int>; #define F0R(i, n) for(int i = 0; i < n;i++) #define FOR(i,a, n) for(int i = a; i < n;i++) #define pb push_back int publish(std::vector<int>); void answer(std::vector<int>); vi remove(vi a, int x) { vi aNew; F0R(i, a.size()) { if (i == x) continue; aNew.pb(a[i]); } return aNew; } vi add(vi a, int x, int u) { vi aNew; F0R(i, a.size()) { if (i == x) { aNew.pb(u); } aNew.pb(a[i]); } return aNew; } void solve(int N) { vi perm(N); F0R(i, N) perm[i] = i + 1; FOR(i, 1, N) { int score = publish(perm); perm = remove(perm, i); perm = add(perm, 0, i + 1); int diff = publish(perm) - score; int index = i - ((i - diff) / 2); perm = remove(perm, 0); perm = add(perm, index, i + 1); } answer(perm); } #if DEBUG void __attribute__((noreturn)) __attribute__((format(printf, 1, 2))) result(const char *msg, ...) { va_list args; va_start(args, msg); vfprintf(stdout, msg, args); fprintf(stdout, "\n"); va_end(args); exit(0); } namespace { int N; int Q = 0; const int MAX_Q = 4000; const int MAX_N = 4000; vector<int> solution; } // namespace int publish(vector<int> R) { printf("publish({"); for(int i = 0; i < int(R.size()); ++i) { if(i == 0) printf("%d", R[i]); else printf(", %d", R[i]); } printf("})\n"); fflush(stdout); if (++Q > MAX_Q) result("Too many published rankings!"); if (int(R.size()) != N) result("Invalid published ranking!"); set<int> chosen; for(auto &x : R) { if(x < 1 || x > N || chosen.count(x)) result("Invalid published ranking!"); chosen.insert(x); } vector<int> positions(N+1); for(int i = 0; i < N; ++i) positions[R[i]] = i; int complaints = 0; for(int i = 0; i < N; ++i) { for(int j = i+1; j < N; ++j) { if(positions[solution[i]] > positions[solution[j]]) ++complaints; } } return complaints; } void __attribute__((noreturn)) answer(vector<int> R) { printf("answer({"); for(int i = 0; i < int(R.size()); ++i) { if(i == 0) printf("%d", R[i]); else printf(", %d", R[i]); } printf("})\n"); fflush(stdout); if(R == solution) result("Correct: %d published ranking(s).", Q); else result("Wrong answer!"); } int main() { if (scanf("%d", &N) != 1 || N < 2 || N > MAX_N) result("Invalid input!"); solution.resize(N); set<int> chosen; for(auto &x : solution) { if(scanf("%d", &x) != 1 || x < 1 || x > N || chosen.count(x)) result("Invalid input!"); chosen.insert(x); } solve(N); result("No answer!"); } #endif

Compilation message (stderr)

art.cpp: In function 'vi remove(vi, int)':
art.cpp:8:36: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    8 | #define F0R(i, n) for(int i = 0; i < n;i++)
......
   18 |     F0R(i, a.size()) {
      |         ~~~~~~~~~~~                 
art.cpp:18:5: note: in expansion of macro 'F0R'
   18 |     F0R(i, a.size()) {
      |     ^~~
art.cpp: In function 'vi add(vi, int, int)':
art.cpp:8:36: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    8 | #define F0R(i, n) for(int i = 0; i < n;i++)
......
   26 |     F0R(i, a.size()) {
      |         ~~~~~~~~~~~                 
art.cpp:26:5: note: in expansion of macro 'F0R'
   26 |     F0R(i, a.size()) {
      |     ^~~
interface.cpp: In function 'int publish(std::vector<int>)':
interface.cpp:20:17: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   20 |     if(v.size() != N) {
      |        ~~~~~~~~~^~~~
interface.cpp: In function 'void answer(std::vector<int>)':
interface.cpp:36:17: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   36 |     if(v.size() != N) {
      |        ~~~~~~~~~^~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...