Submission #431535

#	Time	Username	Problem	Language	Result	Execution time	Memory
431535		saleh	Comparing Plants (IOI20_plants)	C++17	0 / 100	13 ms	14384 KiB

plants

#include "plants.h"//
#include <bits/stdc++.h>


using namespace std;

const int MAXN = 200 * 1000 + 23;//, INF = 1e6;


int n, R[MAXN];
vector<int> v[MAXN], ps[MAXN], ind[MAXN];


void init(int k, vector<int> r) {
	n = r.size();
	if (k == 2) {
		int tmp = -1;
		for (int i = 1; i <= n; i++) if (r[i % n] != r[i - 1]) tmp = i;
		int cnt = 0;
		v[0].push_back(tmp);
		ps[tmp].push_back(0);
		ind[tmp].push_back(0);
		R[0] = r[tmp];
		for (int i = 1; i <= n; i++) if (r[(tmp + i - 1) % n] == r[(tmp + i) % n]) {
			v[cnt].push_back((tmp + i) % n);
			ps[(tmp + i) % n].push_back(cnt);
			ind[(tmp + i) % n].push_back(v[cnt].size() - 1);
		} else {
			v[cnt].push_back((tmp + i) % n);
			ps[(tmp + i) % n].push_back(cnt);
			ind[(tmp + i) % n].push_back(v[cnt].size() - 1);
			cnt++;
			v[cnt].push_back((tmp + i) % n);
			ps[(tmp + i) % n].push_back(cnt);
			ind[(tmp + i) % n].push_back(v[cnt].size() - 1);
			R[cnt] = r[(tmp + i) % n];
		}
	} else if (k * 2 > n && n <= 5000) {
		
	}
	return;
}

int compare_plants(int x, int y) {
	for (int i = 0; i < ps[x].size(); i++) for (int j = 0; j < ps[y].size(); j++) if (ps[x][i] == ps[y][j])
		return (R[ps[x][i]] == ((ind[x][i] < ind[y][i])? 1: 0))? -1: 1;
	return 0;
}

//int main() {init(2, {0, 1, 0, 1}); cout << compare_plants(0, 3); }//

Compilation message (stderr)

plants.cpp: In function 'int compare_plants(int, int)':
plants.cpp:45:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   45 |  for (int i = 0; i < ps[x].size(); i++) for (int j = 0; j < ps[y].size(); j++) if (ps[x][i] == ps[y][j])
      |                  ~~^~~~~~~~~~~~~~
plants.cpp:45:59: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   45 |  for (int i = 0; i < ps[x].size(); i++) for (int j = 0; j < ps[y].size(); j++) if (ps[x][i] == ps[y][j])
      |                                                         ~~^~~~~~~~~~~~~~

• 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