Submission #467864

#	Time	Username	Problem	Language	Result	Execution time	Memory
467864		iskhakkutbilim	Xoractive (IZhO19_xoractive)	C++14	Compilation error	0 ms	0 KiB

Xoractive

#include <cstdio>
#include <cstdlib>
#include <cassert>
#include <vector>
#include <algorithm>

using namespace std;

namespace {
    const int MAX_VALUE_OF_N = 100;
    const int MAX_VALUE_OF_Q = 200;
    int numberOfQueries = 0;
    int n;
    std::vector<int> a;

    void wrong_answer(const char *MSG) {
        printf("-1\n");
        exit(0);
    }
}

void query() {
    numberOfQueries++;

    if (numberOfQueries > MAX_VALUE_OF_Q) {
        wrong_answer("Number of queries exceeded");
    }
}

int ask(int position) {
    query();
    
    if (position < 1 || position > n) {
        wrong_answer("Not correct position");
    }
    return a[position - 1];

}
vector<int> get_pairwise_xor(vector<int> positions) {
    query();
    
    if (positions.empty() || positions.size() > n) {
        wrong_answer("Not correct size");
    }
    
    sort(positions.begin(), positions.end());
    
    for (int i = 1; i < positions.size(); i++) {
        if (positions[i] == positions[i - 1]) {
            wrong_answer("Not unique");
        }
    }

    for (int i = 0; i < positions.size(); i++) {
        if (positions[i] < 1 || positions[i] > n) {
            wrong_answer("Not correct position");
        }
    }

    vector<int> pairwise_xor;
    
    for (int i = 0; i < positions.size(); i++) {
        for (int j = 0; j < positions.size(); j++) {
            pairwise_xor.push_back(a[positions[i] - 1] ^ a[positions[j] - 1]);
        }
    }
    sort(pairwise_xor.begin(), pairwise_xor.end());

    return pairwise_xor;
}


vector<int> guess(int n){
	vector<int> ans(n);
	for(int i = 0;i  < n; i++){
		ans[i] = ask(i + 1);
	}
	return ans;
}

int main() {
    assert(scanf("%d", &n) == 1);

    assert(1 <= n && n <= MAX_VALUE_OF_N);
    
    for (int i = 1; i <= n; i++) {
        int x;

        assert(scanf("%d", &x) == 1);
        assert(x >= 0 && x <= 1000 * 1000 * 1000);

        a.push_back(x);
    }
    vector<int> participant_solution = guess(n);

    if (participant_solution.size() != n) {
        wrong_answer("-1");
    }

	printf("%d\n", n);
    
    for (auto i: participant_solution) {
        printf("%d ", i);
    }
    printf("\n");
    printf("%d\n", numberOfQueries);
    return 0;
}

Compilation message (stderr)

Xoractive.cpp: In function 'std::vector<int> get_pairwise_xor(std::vector<int>)':
Xoractive.cpp:42:47: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   42 |     if (positions.empty() || positions.size() > n) {
      |                              ~~~~~~~~~~~~~~~~~^~~
Xoractive.cpp:48:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   48 |     for (int i = 1; i < positions.size(); i++) {
      |                     ~~^~~~~~~~~~~~~~~~~~
Xoractive.cpp:54:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   54 |     for (int i = 0; i < positions.size(); i++) {
      |                     ~~^~~~~~~~~~~~~~~~~~
Xoractive.cpp:62:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   62 |     for (int i = 0; i < positions.size(); i++) {
      |                     ~~^~~~~~~~~~~~~~~~~~
Xoractive.cpp:63:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   63 |         for (int j = 0; j < positions.size(); j++) {
      |                         ~~^~~~~~~~~~~~~~~~~~
Xoractive.cpp: In function 'int main()':
Xoractive.cpp:96:37: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   96 |     if (participant_solution.size() != n) {
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~
/usr/bin/ld: /tmp/ccIvlngu.o: in function `query()':
grader.cpp:(.text+0x440): multiple definition of `query()'; /tmp/ccmyHY1q.o:Xoractive.cpp:(.text+0x430): first defined here
/usr/bin/ld: /tmp/ccIvlngu.o: in function `ask(int)':
grader.cpp:(.text+0x470): multiple definition of `ask(int)'; /tmp/ccmyHY1q.o:Xoractive.cpp:(.text+0x460): first defined here
/usr/bin/ld: /tmp/ccIvlngu.o: in function `main':
grader.cpp:(.text.startup+0x0): multiple definition of `main'; /tmp/ccmyHY1q.o:Xoractive.cpp:(.text.startup+0x0): first defined here
/usr/bin/ld: /tmp/ccIvlngu.o: in function `get_pairwise_xor(std::vector<int, std::allocator<int> >)':
grader.cpp:(.text+0x4d0): multiple definition of `get_pairwise_xor(std::vector<int, std::allocator<int> >)'; /tmp/ccmyHY1q.o:Xoractive.cpp:(.text+0x5e0): first defined here
collect2: error: ld returned 1 exit status