Submission #900035

#	Time	Username	Problem	Language	Result	Execution time	Memory
900035		nguyentunglam	Comparing Plants (IOI20_plants)	C++17	5 / 100	66 ms	11972 KiB

plants

#include<bits/stdc++.h>
#define fi first
#define se second
#define endl "\n"
#define ii pair<int, int>
using namespace std;

const int N = 4e5 + 10;

int s[2][N], a[N];

int n;

void init (int k, vector<int> r) {
  n = r.size();
  k--;
  for(int i = 1; i <= n; i++) a[i] = a[i + n] = r[i - 1];
  for(int i = 1; i <= n * 2; i++) {
    s[0][i] = s[0][i - 1] + (a[i] == 0);
    s[1][i] = s[1][i - 1] + (a[i] == 1);
  }
}

int check (int l, int r) {
  int s0 = s[0][r - 1] - s[0][l - 1];
  int s1 = s[1][r - 1] - s[1][l - 1];
  if (s0 && s1) return 0;
  if (s0) return 1;
  return -1;
}

int compare_plants(int x, int y) {
  x++; y++;
  int tmp;
  tmp = check(x, y);
  if (tmp) return tmp;
  tmp = check(y, x + n);
  if (tmp) return -tmp;
	return 0;
}

#ifdef ngu
int main() {

    freopen ("task.inp", "r", stdin);
    freopen ("task.out", "w", stdout);

    int n, k, q; cin >> n >> k >> q;

    vector<int> r(n);

    for(int i = 0; i < n; i++) cin >> r[i];

    init(k, r);

    while (q--) {
      int x, y; cin >> x >> y;
      cout << compare_plants(x, y) << endl;
    }
}
#endif // ngu

• Subtask 1: 5 / 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