Submission #825181

#	Time	Username	Problem	Language	Result	Execution time	Memory
825181		LucaIlie	Minerals (JOI19_minerals)	C++17	Compilation error	0 ms	0 KiB

minerals

#include "minerals.h"
#include <cstdio>
#include <cstdlib>
#include <algorithm>

constexpr int MAX_N = 43000;
constexpr int MAX_CALLS = 1000000;

namespace {

    void WrongAnswer(int code) {
        printf("Wrong Answer [%d]\n", code);
        exit(0);
    }

    int N;
    int counterpart[2 * MAX_N + 1];

    int num_queries;
    int num_kinds;
    int on[2 * MAX_N + 1];
    int count[2 * MAX_N + 1];

    int num_answers;
    int answer[2 * MAX_N + 1];
    int frecv[2 * MAX_N + 1];

}  // namespace

int Query(int x) {
    if (!(1 <= x && x <= 2 * N)) {
        WrongAnswer(1);
    }
    if (++num_queries > MAX_CALLS) {
        //WrongAnswer(2);
    }
    const int type = std::min(x, counterpart[x]);
    frecv[x]++;
    if (on[x]) {
        --on[x];
        --count[type];
        if (count[type] == 0) {
            --num_kinds;
        }
    } else {
        ++on[x];
        ++count[type];
        if (count[type] == 1) {
            ++num_kinds;
        }
    }
    /*printf( "ce avem " );
    for ( int i = 1; i <= 2 * N; i++ )
        printf( "%d", on[i] );
    printf( " %d\n", num_kinds );*/

    return num_kinds;
}

void Answer(int a, int b) {
    if (++num_answers > N) {
        WrongAnswer(6);
    }
    if (!(1 <= a && a <= 2 * N && 1 <= b && b <= 2 * N)) {
        WrongAnswer(3);
    }
    if (answer[a] != 0) {
        WrongAnswer(4);
    }
    answer[a] = b;
    if (answer[b] != 0) {
        WrongAnswer(4);
    }
    answer[b] = a;
    if (!(counterpart[a] == b && counterpart[b] == a)) {
        WrongAnswer(5);
    }
}

int main() {
    if (scanf("%d", &N) != 1) {
        fprintf(stderr, "Error while reading input\n");
        exit(1);
    }
    for (int i = 1; i <= N; ++i) {
        int x, y;
        /*if (scanf("%d%d", &x, &y) != 2) {
            fprintf(stderr, "Error while reading input\n");
            exit(1);
        }*/
        x = 2 * i - 1, y = 2 * i;
        counterpart[x] = y;
        counterpart[y] = x;
    }
    Solve(N);
    if (num_answers != N) {
        WrongAnswer(6);
    }
    printf("Accepted: %d\n", num_queries);

    /*int maxFrecv = 0;
    for ( int i = 1; i <= 2 * N; i++ ) {
        maxFrecv = std::max( maxFrecv, frecv[i] );
        printf( "%d ", frecv[i] );
    }
    printf( "MAXIM %d\n", maxFrecv );*/

    return 0;
}

Compilation message (stderr)

/usr/bin/ld: /tmp/ccwzMLLA.o: in function `Query(int)':
grader.cpp:(.text+0x30): multiple definition of `Query(int)'; /tmp/ccx9owHy.o:minerals.cpp:(.text+0x30): first defined here
/usr/bin/ld: /tmp/ccwzMLLA.o: in function `Answer(int, int)':
grader.cpp:(.text+0x100): multiple definition of `Answer(int, int)'; /tmp/ccx9owHy.o:minerals.cpp:(.text+0xe0): first defined here
/usr/bin/ld: /tmp/ccwzMLLA.o: in function `main':
grader.cpp:(.text.startup+0x0): multiple definition of `main'; /tmp/ccx9owHy.o:minerals.cpp:(.text.startup+0x0): first defined here
/usr/bin/ld: /tmp/ccx9owHy.o: in function `main':
minerals.cpp:(.text.startup+0x54): undefined reference to `Solve(int)'
/usr/bin/ld: /tmp/ccwzMLLA.o: in function `main':
grader.cpp:(.text.startup+0xbd): undefined reference to `Solve(int)'
collect2: error: ld returned 1 exit status