oj.uz

답안 #485295

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
485295 2021-11-07T03:30:05 Z errorgorn Sažetak (COCI17_sazetak) C++17
64 / 160
 500 ms 316 KB 
//雪花飄飄北風嘯嘯
//天地一片蒼茫

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
#define ll long long
#define ii pair<ll,ll>
#define iii pair<ii,ll>
#define fi first
#define se second
#define endl '\n'
#define debug(x) cout << #x << ": " << x << endl

#define pub push_back
#define pob pop_back
#define puf push_front
#define pof pop_front
#define lb lower_bound
#define ub upper_bound

#define rep(x,start,end) for(auto x=(start)-((start)>(end));x!=(end)-((start)>(end));((start)<(end)?x++:x--))
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()

#define indexed_set tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>
//change less to less_equal for non distinct pbds, but erase will bug

mt19937 rng(chrono::system_clock::now().time_since_epoch().count());

int n,m;
int arr[10];

int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin.exceptions(ios::badbit | ios::failbit);
	
	cin>>n>>m;
	rep(x,0,m) cin>>arr[x];
	
	int ans=0;
	
	int p=1;
	rep(x,1,n){
		int c=0;
		rep(y,0,m) if (x%arr[y]==0) c=1;
		
		if (c && p) ans++;
		p=c;
	}
	if (p) ans++;
	cout<<ans<<endl;
}

Subtask #1
64.0 / 160.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 316 KB Output is correct
3 Correct 177 ms 296 KB Output is correct
4 Correct 142 ms 204 KB Output is correct
5 Execution timed out 1094 ms 204 KB Time limit exceeded
6 Execution timed out 1068 ms 204 KB Time limit exceeded
7 Execution timed out 1086 ms 204 KB Time limit exceeded
8 Execution timed out 1089 ms 204 KB Time limit exceeded
9 Execution timed out 1093 ms 204 KB Time limit exceeded
10 Execution timed out 1095 ms 204 KB Time limit exceeded