oj.uz

Submission #632086

# Submission time Handle Problem Language Result Execution time Memory
632086 2022-08-19T12:09:50 Z CSQ31 Boat (APIO16_boat) C++17
0 / 100
 287 ms 524288 KB 
#pragma GCC optimize("Ofast") 
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define sz(a) a.size()
#define all(a) a.begin(),a.end()
#define lb lower_bound
#define ub upper_bound
#define owo ios_base::sync_with_stdio(0);cin.tie(0);
#define INF (int)(1e9)
#define debug(...) fprintf(stderr, __VA_ARGS__),fflush(stderr)
#define time__(d) for(long blockTime = 0; (blockTime == 0 ? (blockTime=clock()) != 0 : false);\
debug("%s time : %.4fs\n", d, (double)(clock() - blockTime) / CLOCKS_PER_SEC))
typedef long long int ll;
typedef long double ld;
typedef pair<ll,ll> PII;
typedef pair<int,int> pii;
typedef vector<vector<int>> vii;
typedef vector<vector<ll>> VII;
ll gcd(ll a,ll b){if(!b)return a;else return gcd(b,a%b);}
const int MOD = 1e9+7;
int dp[501][1001][501]; //boat,group,cnt
int a[501],b[501];
int main()
{
	owo
	int n;
	cin>>n;
	vector<int>c;
	for(int i=0;i<n;i++){
		cin>>a[i]>>b[i];
		c.pb(a[i]);
		c.pb(b[i]+1);
	}
	sort(all(c));
	c.resize(unique(all(c)) - c.begin());
	int m = sz(c),tot = 1;
	for(int i=0;i<n;i++){
		tot = 1;
		for(int j=0;j+1<m;j++){
			int s = c[j+1]-c[j];
			if(i){//dont add you
				for(int k=1;k<=min(n,s);k++)dp[i][j][k] = dp[i-1][j][k];
			}
			if(a[i] <= c[j] && c[j] <= b[i]){ 
				//add you in new group
				dp[i][j][1] += tot * 1LL * s%MOD;
				if(dp[i][j][1]>=MOD)dp[i][j][1]-=MOD;
				if(i){ //add you to existing group
					for(int k=2;k<=min(n,s);k++){
						dp[i][j][k] += dp[i-1][j][k-1] * 1LL * (s-k+1)%MOD;
						if(dp[i][j][k]>=MOD)dp[i][j][k]-=MOD;
					}
				}
			}
			if(!i)continue;
			for(int k=1;k<=min(n,s);k++){//update tot
				tot+=dp[i-1][j][k];
				if(tot>=MOD)tot-=MOD;
			}
			
		}
	}
	int ans = 0;
	for(int i=0;i<m;i++){
		for(int j=1;j<=n;j++){
			ans+=dp[n-1][i][j];
			ans%=MOD;
		}
	}
	cout<<ans;
}

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Runtime error 287 ms 524288 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #2
0 / 22.0

# Verdict Execution time Memory Grader output
1 Runtime error 287 ms 524288 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

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

Subtask #4
0 / 42.0

# Verdict Execution time Memory Grader output
1 Runtime error 287 ms 524288 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -