제출 #426844

#제출 시각아이디문제언어결과실행 시간메모리
426844PbezzSplit the Attractions (IOI19_split)C++14
0 / 100
49 ms4652 KiB
#include "split.h" #include <bits/stdc++.h> using namespace std; #define ll long long #define pb push_back typedef pair<ll,ll> pii; const ll MAXN = 2e5+5; const ll INF = 1e9+7; vector<int> find_split(int n,int a,int b,int c,vector<int>p,vector<int> q) { int i; vector<int> res(n); for(i=0;i<a;i++)res[i]=1; for(i=a;i<a+b;i++)res[i]=2; for(i=a+b;i<n;i++)res[i]=3; return res; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...