oj.uz

답안 #555128

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
555128 2022-04-30T08:15:39 Z Khizri Radio (COCI22_radio) C++17
10 / 110
 43 ms 21572 KB 
#include <bits/stdc++.h>
using namespace std;
//------------------------------DEFINE------------------------------
//******************************************************************
#define IOS ios_base::sync_with_stdio(false); cin.tie(0),cout.tie(0)
#define ll long long
#define pb push_back
#define F first
#define S second
#define INF 1e18
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define pii pair<int,int>
#define pll pair<ll,ll>
#define OK cout<<"Ok"<<endl;
#define MOD (ll)(1e9+7)
#define endl "\n"
//******************************************************************
//----------------------------FUNCTION------------------------------
//******************************************************************
ll gcd(ll a,ll b){
    if(a>b) swap(a,b);
    if(a==0) return a+b;
    return gcd(b%a,a);
}
ll lcm(ll a,ll b){
    return a/gcd(a,b)*b;
}
bool is_prime(ll n){
    ll k=sqrt(n);

    if(n==2) return true;
    if(n<2||n%2==0||k*k==n) return false;
    for(int i=3;i<=k;i+=2){
        if(n%i==0){
            return false;
        }
    }
    return true;
}
//*****************************************************************
//--------------------------MAIN-CODE------------------------------
const int mxn=2e5+5;
int t=1,n,q,arr[mxn],mp[mxn];
vector<int>vt[mxn];
void pre(){
    for(int i=2;i<=n;i++){
        if(vt[i].size()) continue;
        for(int j=i;j<=n;j+=i){
            vt[j].pb(i);
        }
    }
}
void solve2(){
    while(q--){
        char c;
        cin>>c;
        if(c=='S'){
            int x;
            cin>>x;
            if(arr[x]==0){
                arr[x]=1;
            }
            else{
                arr[x]=0;
            }
        }
        else{
            int l,r;
            cin>>l>>r;
            bool ok=false;
            for(int i=l;i<=r;i++){
                for(int j=i+1;j<=r;j++){
                    if(arr[i]&&arr[j]&&gcd(i,j)>1){
                        ok=true;
                    }
                }
            }
            if(ok){
                cout<<"DA"<<endl;
            }
            else{
                cout<<"NE"<<endl;
            }
        }
    }
}
void solve(){
    cin>>n>>q;
    if(n<=100&&q<=200){
        solve2();
        return;
    }
    pre();
    int ans=0;
    while(q--){
        char c;
        cin>>c;
        if(c=='S'){
            int x;
            cin>>x;
            if(arr[x]==0){
                arr[x]=1;
                for(int v:vt[x]){
                    if(mp[v]==1){
                        ans++;
                    }
                    mp[v]++;
                }
            }
            else{
                arr[x]=0;
                for(int v:vt[x]){
                    if(mp[v]==2){
                        ans--;
                    }
                    mp[v]--;
                }
            }
        }
        else{
            int l,r;
            cin>>l>>r;
            if(ans){
                cout<<"DA"<<endl;
            }
            else{
                cout<<"NE"<<endl;
            }
        }
    }
}
int main(){
    IOS;
    //cin>>t;
    while(t--){
        solve();
    }
    return 0;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 5020 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct

Subtask #2
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 43 ms 9028 KB Output is correct
2 Runtime error 18 ms 21572 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #3
0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 5020 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 43 ms 9028 KB Output is correct
9 Runtime error 18 ms 21572 KB Execution killed with signal 11
10 Halted 0 ms 0 KB -