Submission #1176393

#	Time	Username	Problem	Language	Result	Execution time	Memory
1176393		somefolk	Comparing Plants (IOI20_plants)	C++20	0 / 100	0 ms	328 KiB

plants

#include <iostream>
#include <cmath>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
#include <unordered_map>
#include <queue>
#include <set>
#include <unordered_set>
#include <complex>
#include <list>
#include <cassert>
#include <chrono>
#include <random>
#include <stack>
#include <iomanip>
#include <fstream>
using namespace std;

#define endl "\n"
// #define int long long

const int INF = 1e9+7;
const int MOD = 1e9+7;

int n, k;
vector<int> r;

void init(int k1, vector<int> r1){
    n = r.size();
    k = k1-1;
    r = r1;
}

int compare_plants(int x, int y){
    if(abs(x-y) > 1) return 0;
    else if(x < y) return (r[x] ? -1 : 1);
    else return (r[y] ? 1 : -1);
}

• 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