Submission #553621

#	Time	Username	Problem	Language	Result	Execution time	Memory
553621		InternetPerson10	Comparing Plants (IOI20_plants)	C++17	0 / 100	1 ms	296 KiB

plants

#include "plants.h"
#include <bits/stdc++.h>
typedef long long ll;

using namespace std;

ll BIG = 1e7;
vector<ll> ans;
int k, n;

void init(int g, std::vector<int> r) {
    k = g;
    k--;
    n = r.size();
    ans.resize(n);
    if(k == 1) {
        ans.resize(3*n+1);
        ans[0] = 0;
        for(int i = 0; i < 3*n+1; i++) {
            if(r[i%n]) ans[i] = ans[i-1] - 1;
            else ans[i] = ans[i-1] + 1;
        }
    }
    for(int i = 0; i < n; i++) {
        cout << ans[i] << ' ';
    }
    cout << endl;
	return;
}

int compare_plants(int x, int y) {
    if(k == 1) {
        for(int i = x + n; i <= 3*n; i += n) {
            for(int j = y + n; j <= 3*n; j += n) {
                int a = min(x, y);
                int b = max(x, y);
                if(ans[b] - ans[a] == b - a) {
                    if(a == x) return 1;
                    return -1;
                }
                if(ans[a] - ans[b] == b - a) {
                    if(a == x) return -1;
                    return 1;
                }
            }
        }
        return 0;
    }
}

Compilation message (stderr)

plants.cpp: In function 'int compare_plants(int, int)':
plants.cpp:49:1: warning: control reaches end of non-void function [-Wreturn-type]
   49 | }
      | ^

• Subtask 1: 0 / 5
• Subtask 2: 0 / 14
• Subtask 3: 0 / 13
• Subtask 4: 0 / 17
• Subtask 5: 0 / 11
• Subtask 6: 0 / 15
• Subtask 7: 0 / 25