Submission #981059

#	Time	Username	Problem	Language	Result	Execution time	Memory
981059		vjudge1	Beech Tree (IOI23_beechtree)	C++17	0 / 100	1 ms	348 KiB

beechtree

#include <algorithm>
#include <fstream>
#include <vector>
#include <queue>
#include <stack>
#include <iostream>
#include <cmath>
#include <queue>
#include <set>
#include <string>
#include <cstring>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
#define F first
#define S second
#define PB push_back
using namespace std;
const long long MOD=1e9+7, INF=1e18;
const int INFI=1e9;
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ii> vii;
typedef vector<pair<int, ii>> viii;
typedef vector<vii> vvii;
typedef vector<ll> vll;
typedef vector<vll> vvll;

vi beechtree(int n, int m, vi p, vi c){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    vi ans(n, 0), pref(n+1, 0);
    set<int> cnt;
    for(int i=n-1;i>=0;i--){
        if(cnt.size()==1)   ans[i]=1;
        cnt.insert(c[i]);
    }
    return ans;
}

• Subtask 0: 0 / 0
• Subtask 1: 0 / 9
• Subtask 2: 0 / 5
• Subtask 3: 0 / 9
• Subtask 4: 0 / 8
• Subtask 5: 0 / 14
• Subtask 6: 0 / 14
• Subtask 7: 0 / 12
• Subtask 8: 0 / 17
• Subtask 9: 0 / 12