제출 #637804

#제출 시각아이디문제언어결과실행 시간메모리
637804beaconmcJob Scheduling (CEOI12_jobs)C++14
0 / 100
19 ms1620 KiB
#include <bits/stdc++.h> #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> typedef long long ll; using namespace std; using namespace __gnu_pbds; #define FOR(i, x, y) for(ll i=x; i<y; i++) #define FORNEG(i, x, y) for(ll i=x; i>y; i--) #define ordered_set tree<ll, null_type,less_equal<ll>, rb_tree_tag,tree_order_statistics_node_update> #define fast() ios_base::sync_with_stdio(false);cin.tie(NULL) ll temp; ll n,d,m; int main(){ cin >> n >> d >> m; ll lis[n]; FOR(i,0,n){ cin >> temp; lis[temp-1] += 1; } }
#Verdict Execution timeMemoryGrader output
Fetching results...