# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
154377 | 2019-09-21T12:15:59 Z | PedroBigMan | San (COCI17_san) | C++14 | 1000 ms | 504 KB |
#include <iostream> #include <vector> #include <cmath> #include <algorithm> #include <string> using namespace std; typedef long long int ll; typedef unsigned long long int ull; typedef long double ld; #define REP(i,a,b) for(ll i=a; i<b; i++) #define pb push_back #define mp make_pair #define pl pair<ll,ll> #define ff first #define ss second #define INF ((ll) pow(2,63) -1) #define si signed ll insig; #define In(vecBRO, LENBRO) REP(IBRO,0,LENBRO) {cin>>insig; vecBRO.pb(insig);} void Out(vector<ll> x) {REP(i,0,x.size()) {cout<<x[i]<<" ";} cout<<endl;} ll ans; class DAG { public: ll N,K; vector<vector<ll> > adj; vector<ll> w; ll curs; DAG(vector<vector<ll> > ad, vector<ll> g, ll Mc) { w=g; N=g.size(); adj=ad; K=Mc; curs=0; } void DFS(ll s) { curs+=w[s]; if(curs>=K) {ans++;} REP(i,0,adj[s].size()) { DFS(adj[s][i]); } curs-=w[s]; } }; int main() { ios_base::sync_with_stdio(0); cin.tie(0); ll N,K; cin>>N>>K; vector<ll> h,g; ll cur; REP(i,0,N) {cin>>cur; h.pb(cur); cin>>cur; g.pb(cur);} vector<vector<ll> > adj; vector<ll> xx; REP(i,0,N) {adj.pb(xx);} REP(i,0,N) { REP(j,i+1,N) { if(h[j]>=h[i]) {adj[i].pb(j);} } } DAG G(adj,g,K); ans=0; REP(i,0,N) { G.curs=0; G.DFS(i); } cout<<ans<<endl; return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 504 KB | Output is correct |
2 | Correct | 2 ms | 376 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 4 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 376 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Execution timed out | 1077 ms | 376 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Execution timed out | 1068 ms | 380 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Execution timed out | 1078 ms | 376 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |