#include <bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(NULL);
int64_t n;
int q;
cin >> n >> q;
vector<int64_t> zap(q);
vector<bool> sequence(n + 1, 0);
vector<bool> zloz(n);
vector<int64_t> primes;
for (int i = 2; i < n; i++)
{
if (!zloz[i])
{
primes.push_back(i);
for (int j = 2 * i; j < n; j += i)
{
zloz[j] = true;
}
}
}
int nprimes = primes.size();
vector<map<int64_t, int64_t>> modcounts(nprimes);
multiset<int64_t> allres;
for (int i = 0; i < q; i++)
{
cin >> zap[i];
if (sequence[zap[i]] == 0)
{
sequence[zap[i]] = 1;
for (int j = 0; j < nprimes; j++)
{
auto it = modcounts[j].find(zap[i] % primes[j]);
if (it != modcounts[j].end())
{
allres.erase(allres.find(it->second));
it->second++;
allres.insert(it->second);
}
else{
modcounts[j][zap[i] % primes[j]] = 1;
allres.insert(1);
}
}
}
else{
sequence[zap[i]] = 0;
for (int j = 0; j < nprimes; j++)
{
auto it = modcounts[j].find(zap[i] % primes[j]);
allres.erase(allres.find(it->second));
it->second--;
if(it->second == 0){
modcounts[j].erase(zap[i] % primes[j]);
}
else{
allres.insert(it->second);
}
}
}
if(allres.size() == 0){
cout<<"0\n";
}
else{
cout<<*prev(allres.end())<<"\n";
}
}
}
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 | #include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(NULL); int64_t n; int q; cin >> n >> q; vector<int64_t> zap(q); vector<bool> sequence(n + 1, 0); vector<bool> zloz(n); vector<int64_t> primes; for (int i = 2; i < n; i++) { if (!zloz[i]) { primes.push_back(i); for (int j = 2 * i; j < n; j += i) { zloz[j] = true; } } } int nprimes = primes.size(); vector<map<int64_t, int64_t>> modcounts(nprimes); multiset<int64_t> allres; for (int i = 0; i < q; i++) { cin >> zap[i]; if (sequence[zap[i]] == 0) { sequence[zap[i]] = 1; for (int j = 0; j < nprimes; j++) { auto it = modcounts[j].find(zap[i] % primes[j]); if (it != modcounts[j].end()) { allres.erase(allres.find(it->second)); it->second++; allres.insert(it->second); } else{ modcounts[j][zap[i] % primes[j]] = 1; allres.insert(1); } } } else{ sequence[zap[i]] = 0; for (int j = 0; j < nprimes; j++) { auto it = modcounts[j].find(zap[i] % primes[j]); allres.erase(allres.find(it->second)); it->second--; if(it->second == 0){ modcounts[j].erase(zap[i] % primes[j]); } else{ allres.insert(it->second); } } } if(allres.size() == 0){ cout<<"0\n"; } else{ cout<<*prev(allres.end())<<"\n"; } } } |
English