Submission #313221

#	Time	Username	Problem	Language	Result	Execution time	Memory
313221		DanerZein	Comparing Plants (IOI20_plants)	C++14	0 / 100	4056 ms	5488 KiB

plants

#include "plants.h"
#include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
vi ra;
int n;
void init(int k, std::vector<int> r) {
  int t=r.size();
  for(int i=0;i<t;i++) ra.push_back(r[i]);
  n=r.size();
  return;
}

int compare_plants(int x, int y) {
  int o1,o2;
  o1=ra[x]; o2=ra[y];
  int l1,l2;
  l2=((x-1)+n)%n;
  l1=((y-1)+n)%n;
  int i=x;
  while(true){
    if(o1!=ra[i]){
      o1=-1;
      break;
    }
    if(i==l1) break;
    i++;
    i%=n;
  }
  i=y;
  while(true){
    if(o2!=ra[i]){
      o2=-1;
      break;
    }
    if(i==l2) break;
    i++;
    i%=n;
  }
  //cout<<o1<<" "<<o2<<" "<<l1<<" "<<l2<<" "<<ra[y]<<" "<<ra[x]<<endl;
  if(o1==o2 and o1==-1){
    return 0;
  }
  if(o1!=-1){
    if(o1==1) return -1;
    else return 1;
  }
  if(o2!=-1){
    if(o2==1) return 1;
    else return -1;
  }
}

Compilation message (stderr)

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

• 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