Submission #1624091
Source Code Expand
/**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author
*/
#ifndef MAJK_LIB
#define MAJK_LIB
#include <vector>
#include <stack>
#include <iostream>
#include <unordered_map>
#include <map>
#include <iomanip>
#include <set>
#include <functional>
#include <fstream>
#include <algorithm>
#include <cassert>
#include <cmath>
#include <string>
#include <sstream>
#include <queue>
#include <bitset>
using namespace std;
#define x first
#define y second
constexpr int MOD = 1000000007;
typedef std::pair<int,int> pii;
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int ui;
template <typename T, typename U> std::istream&operator>>(std::istream&i, pair<T,U>&p) {i >> p.x >> p.y; return i;}
template<typename T>std::istream&operator>>(std::istream&i,vector<T>&t) {for(auto&v:t){i>>v;}return i;}
template<typename T>std::ostream&operator<<(std::ostream&o,const vector<T>&t) {for(size_t i=0;i<t.size();++i){o<<t[i]<<" \n"[i == t.size()-1];}return o;}
template<typename T> using minheap = priority_queue<T, vector<T>, greater<T>>;
template<typename T> using maxheap = priority_queue<T, vector<T>, less<T>>;
auto fraclt = [](const pii&a,const pii&b) { return (ll)a.x * b.y < (ll)b.x * a.y; };
struct cmpfrac { bool operator()(const pii&a,const pii&b)const { return (ll)a.x * b.y < (ll)b.x * a.y; }};
template <typename T> bool in(T a, T b, T c) { return a <= b && b < c; }
ui logceil(ll x) {ui b=0;while(x){x>>=1;++b;}return b;}
namespace std {
template<typename T,typename U>struct hash<pair<T,U>>{hash<T>t;hash<U>u;size_t operator()(const pair<T,U>&p)const{return t(p.x)^(u(p.y)<<7);}};
}
template<typename T,typename F>T bsh(T l,T h,const F&f){T r=-1,m;while(l<=h){m=(l+h)/2;if(f(m)){l=m+1;r=m;}else{h=m-1;}}return r;}
template<typename T,typename F>T bsl(T l,T h,const F&f){T r=-1,m;while(l<=h){m=(l+h)/2;if(f(m)){h=m-1;r=m;}else{l=m+1;}}return r;}
template<typename T> T gcd(T a,T b) { if (a<b) swap(a,b); return b?gcd(b,a%b):a; }
template<typename T>class vector2:public vector<vector<T>>{public:vector2(){} vector2(size_t a,size_t b,T t=T()):vector<vector<T>>(a,vector<T>(b,t)){}};
template<typename T>class vector3:public vector<vector<vector<T>>>{public:vector3(){} vector3(size_t a,size_t b,size_t c,T t=T()):vector<vector<vector<T>>>(a,vector<vector<T>>(b,vector<T>(c,t))){}};
template <typename T> struct bounded_priority_queue {
inline bounded_priority_queue(ui X) : A(X), B(0) {}
inline void push(ui L, T V) { B = max(B, L); A[L].push(V); }
inline const T &top() const { return A[B].front(); }
inline void pop() { A[B].pop(); while (B > 0 && A[B].empty()) --B; }
inline bool empty() const { return A[B].empty(); }
inline void clear() { B = 0; for (auto &a: A) a = queue<T>(); }
private:
vector<queue<T>> A; ui B;
};
#endif
// #include "../l/mod.h"
class C {
public:
void solve(istream& cin, ostream& cout) {
int N, M; cin >> N >> M;
vector<int> A(N); cin >> A;
vector<int> C(N, 0), Q(N, 0);
int L = N;
for (int &a:A) {
--a;
if (a - C[a] >= 0) {
if (!Q[a-C[a]]++) --L;
}
C[a]++;
}
for (int i = 0; i < M; ++i) {
int x, y; cin >> x >> y; --x; --y;
--C[A[x]];
if (A[x] - C[A[x]] >= 0) {
if (!--Q[A[x]-C[A[x]]]) ++L;
}
A[x] = y;
if (A[x] - C[A[x]] >= 0) {
if (!Q[A[x]-C[A[x]]]++) --L;
}
++C[A[x]];
cout << L << '\n';
}
}
};
int main() {
ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
C solver;
std::istream& in(std::cin);
std::ostream& out(std::cout);
solver.solve(in, out);
return 0;
}
Submission Info
Submission Time |
|
Task |
C - Snuke and Spells |
User |
majk |
Language |
C++14 (GCC 5.4.1) |
Score |
1000 |
Code Size |
3902 Byte |
Status |
AC |
Exec Time |
88 ms |
Memory |
3840 KB |
Judge Result
Set Name |
Sample |
subtask |
All |
Score / Max Score |
0 / 0 |
500 / 500 |
500 / 500 |
Status |
|
|
|
Set Name |
Test Cases |
Sample |
sample1.txt, sample2.txt, sample3.txt |
subtask |
sample1.txt, sample2.txt, sample3.txt, subtask_a1.txt, subtask_a2.txt, subtask_a3.txt, subtask_a4.txt, subtask_a5.txt, subtask_a6.txt, subtask_b1.txt, subtask_b2.txt, subtask_c1.txt, subtask_c2.txt, subtask_d1.txt, subtask_d2.txt, subtask_d3.txt, subtask_d4.txt, subtask_e1.txt, subtask_e2.txt, subtask_e3.txt, subtask_e4.txt, subtask_f1.txt, subtask_f2.txt |
All |
sample1.txt, sample2.txt, sample3.txt, a1.txt, a2.txt, a3.txt, a4.txt, a5.txt, a6.txt, b1.txt, b2.txt, c1.txt, c2.txt, d1.txt, d2.txt, d3.txt, d4.txt, e1.txt, e2.txt, e3.txt, e4.txt, f1.txt, f2.txt, sample1.txt, sample2.txt, sample3.txt, subtask_a1.txt, subtask_a2.txt, subtask_a3.txt, subtask_a4.txt, subtask_a5.txt, subtask_a6.txt, subtask_b1.txt, subtask_b2.txt, subtask_c1.txt, subtask_c2.txt, subtask_d1.txt, subtask_d2.txt, subtask_d3.txt, subtask_d4.txt, subtask_e1.txt, subtask_e2.txt, subtask_e3.txt, subtask_e4.txt, subtask_f1.txt, subtask_f2.txt |
Case Name |
Status |
Exec Time |
Memory |
a1.txt |
AC |
80 ms |
3840 KB |
a2.txt |
AC |
80 ms |
3840 KB |
a3.txt |
AC |
81 ms |
3840 KB |
a4.txt |
AC |
80 ms |
3840 KB |
a5.txt |
AC |
78 ms |
3712 KB |
a6.txt |
AC |
80 ms |
3840 KB |
b1.txt |
AC |
84 ms |
3712 KB |
b2.txt |
AC |
80 ms |
3712 KB |
c1.txt |
AC |
80 ms |
3712 KB |
c2.txt |
AC |
80 ms |
3712 KB |
d1.txt |
AC |
80 ms |
3712 KB |
d2.txt |
AC |
80 ms |
3712 KB |
d3.txt |
AC |
80 ms |
3712 KB |
d4.txt |
AC |
88 ms |
3712 KB |
e1.txt |
AC |
80 ms |
3712 KB |
e2.txt |
AC |
80 ms |
3712 KB |
e3.txt |
AC |
80 ms |
3840 KB |
e4.txt |
AC |
82 ms |
3840 KB |
f1.txt |
AC |
65 ms |
3840 KB |
f2.txt |
AC |
65 ms |
3840 KB |
sample1.txt |
AC |
1 ms |
256 KB |
sample2.txt |
AC |
1 ms |
256 KB |
sample3.txt |
AC |
1 ms |
256 KB |
subtask_a1.txt |
AC |
1 ms |
256 KB |
subtask_a2.txt |
AC |
1 ms |
256 KB |
subtask_a3.txt |
AC |
1 ms |
256 KB |
subtask_a4.txt |
AC |
1 ms |
256 KB |
subtask_a5.txt |
AC |
1 ms |
256 KB |
subtask_a6.txt |
AC |
1 ms |
256 KB |
subtask_b1.txt |
AC |
1 ms |
256 KB |
subtask_b2.txt |
AC |
1 ms |
256 KB |
subtask_c1.txt |
AC |
1 ms |
256 KB |
subtask_c2.txt |
AC |
1 ms |
256 KB |
subtask_d1.txt |
AC |
1 ms |
256 KB |
subtask_d2.txt |
AC |
1 ms |
256 KB |
subtask_d3.txt |
AC |
1 ms |
256 KB |
subtask_d4.txt |
AC |
1 ms |
256 KB |
subtask_e1.txt |
AC |
1 ms |
256 KB |
subtask_e2.txt |
AC |
1 ms |
256 KB |
subtask_e3.txt |
AC |
1 ms |
256 KB |
subtask_e4.txt |
AC |
1 ms |
256 KB |
subtask_f1.txt |
AC |
1 ms |
256 KB |
subtask_f2.txt |
AC |
1 ms |
256 KB |