oj.uz

Submission #1026002

# Submission time Handle Problem Language Result Execution time Memory
1026002 2024-07-17T12:27:30 Z vjudge1 San (COCI17_san) C++17
48 / 120
 52 ms 348 KB 
#include<bits/stdc++.h>

using namespace std;

typedef long long ll;

int main()
{
  int n;
  ll k;
  cin >> n >> k;
  ll h[n], x[n];
  for(int i = 0; i < n; i ++)
    cin >> h[i] >> x[i];

  int ans = 0;
  for(int mask = 0; mask < (1 << n); mask++)
    {
      ll sm = 0;
      int prv =  0;
      for(int i = 0; i < n; i ++)
	{
	  if((1 << i) & mask)
	    {
	      if(prv > h[i])
		{
		  sm = 0;
		  break;
		}
	      sm += x[i];
	      prv = h[i];
	    }
	}
      if(sm >= k) ans++;
    }
  cout << ans << endl;
  return 0;
}

Subtask #1
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 344 KB Output is correct
2 Correct 10 ms 348 KB Output is correct

Subtask #3
0 / 24.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 24.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -