oj.uz

Submission #154377

# Submission time Handle Problem Language Result Execution time Memory
154377 2019-09-21T12:15:59 Z PedroBigMan San (COCI17_san) C++14
48 / 120
 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

san.cpp: In function 'void Out(std::vector<long long int>)':
san.cpp:10:33: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define REP(i,a,b) for(ll i=a; i<b; i++)
san.cpp:20:29:
 void Out(vector<ll> x) {REP(i,0,x.size()) {cout<<x[i]<<" ";} cout<<endl;}
                             ~~~~~~~~~~~~
san.cpp:20:25: note: in expansion of macro 'REP'
 void Out(vector<ll> x) {REP(i,0,x.size()) {cout<<x[i]<<" ";} cout<<endl;}
                         ^~~
san.cpp: In member function 'void DAG::DFS(ll)':
san.cpp:10:33: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define REP(i,a,b) for(ll i=a; i<b; i++)
san.cpp:39:13:
         REP(i,0,adj[s].size()) 
             ~~~~~~~~~~~~~~~~~    
san.cpp:39:9: note: in expansion of macro 'REP'
         REP(i,0,adj[s].size()) 
         ^~~

Subtask #1
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 376 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct

Subtask #3
0 / 24.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1077 ms 376 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 24.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1068 ms 380 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1078 ms 376 KB Time limit exceeded
2 Halted 0 ms 0 KB -