Submission #895396
Source Code Expand
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<set>
#include<string>
#include<stack>
#include<cstdio>
#include<cmath>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> P;
typedef pair<int,P> P1;
#define fr first
#define sc second
#define mp make_pair
#define pb push_back
#define rep(i,x) for(int i=0;i<x;i++)
#define rep1(i,x) for(int i=1;i<=x;i++)
#define rrep(i,x) for(int i=x-1;i>=0;i--)
#define rrep1(i,x) for(int i=x;i>0;i--)
#define sor(v) sort(v.begin(),v.end())
#define rev(s) reverse(s.begin(),s.end())
#define lb(vec,a) lower_bound(vec.begin(),vec.end(),a)
#define ub(vec,a) upper_bound(vec.begin(),vec.end(),a)
#define uniq(vec) vec.erase(unique(vec.begin(),vec.end()),vec.end())
#define mp1(a,b,c) P1(a,P(b,c))
const ll INF=1000000000000000000;
const int dir_4[4][2]={{1,0},{0,1},{-1,0},{0,-1}};
const int dir_8[8][2]={{1,0},{1,1},{0,1},{-1,1},{-1,0},{-1,-1},{0,-1},{1,-1}};
int main(){
static int n,m,q;
static int a[100010];
scanf("%d%d%d",&n,&m,&q);
rep(i,q)scanf("%d",&a[i]);
static int b[100010];
rep1(i,m)b[i] = q+1;
rep(i,q)b[a[i]] = q-i;
vector<P> vec;
rep1(i,m){
vec.pb(P(b[i],i));
}
sor(vec);
static int c[100010];
int k = 0;
rep(i,vec.size()){
c[vec[i].sc] = i+1;
if(vec[i].fr != q+1)k ++;
}
int t = vec.size()-1;
while(t > 0 && vec[t-1].sc < vec[t].sc)t --;
//rep(i,vec.size())printf("%lld %lld\n",vec[i].fr,vec[i].sc);
//cout << c[1] << " " << c[2] << " " << c[3] << endl;
//cout << t << " " << k << endl;
static int cnt[100010] = {};
static bool used[100010];
rep(i,100010)used[i] = false;
cnt[0] = n;
used[0] = true;
rrep(i,q){
if(cnt[c[a[i]]-1] > 0){
cnt[c[a[i]]-1] --;
cnt[c[a[i]]] ++;
used[c[a[i]]] = true;
}
else {
if(!used[c[a[i]]]){
puts("No");
return 0;
}
}
}
//cout << cnt[0] << " " << cnt[1] << " " << cnt[2] << " " << cnt[3] << endl;
int ret = 0;
for(int i = t ; i <= k ; i ++)ret += cnt[i];
if(ret == n)puts("Yes");
else puts("No");
}
Submission Info
Submission Time
2016-09-24 21:59:28+0900
Task
E - LRU Puzzle
User
yokozuna57
Language
C++14 (GCC 5.4.1)
Score
1200
Code Size
2140 Byte
Status
AC
Exec Time
26 ms
Memory
3696 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:40:26: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d%d",&n,&m,&q);
^
./Main.cpp:41:27: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
rep(i,q)scanf("%d",&a[i]);
^
Judge Result
Set Name
Sample
All
Score / Max Score
0 / 0
1200 / 1200
Status
Set Name
Test Cases
Sample
0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt
All
0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 1_13.txt, 1_14.txt, 1_15.txt, 1_16.txt, 1_17.txt, 1_18.txt, 1_19.txt, 1_20.txt, 1_21.txt, 1_22.txt, 1_23.txt, 1_24.txt, 1_25.txt, 1_26.txt, 1_27.txt, 1_28.txt, 1_29.txt, 1_30.txt, 1_31.txt, 1_32.txt, 1_33.txt, 1_34.txt, 1_35.txt, 1_36.txt, 1_37.txt, 1_38.txt, 1_39.txt, 1_40.txt, 1_41.txt, 1_42.txt, 1_43.txt, 1_44.txt, 1_45.txt, 1_46.txt, 1_47.txt, 1_48.txt, 1_49.txt, 1_50.txt, 1_51.txt, 1_52.txt, 1_53.txt, 1_54.txt, 1_55.txt, 1_56.txt, 1_57.txt, 1_58.txt, 1_59.txt, 1_60.txt, 1_61.txt, 1_62.txt, 1_63.txt, 1_64.txt, 1_65.txt, 1_66.txt, 1_67.txt, 1_68.txt, 1_69.txt, 1_70.txt, 1_71.txt
Case Name
Status
Exec Time
Memory
0_00.txt
AC
3 ms
384 KB
0_01.txt
AC
3 ms
384 KB
0_02.txt
AC
3 ms
384 KB
0_03.txt
AC
3 ms
384 KB
1_00.txt
AC
3 ms
384 KB
1_01.txt
AC
3 ms
384 KB
1_02.txt
AC
19 ms
3188 KB
1_03.txt
AC
19 ms
3188 KB
1_04.txt
AC
19 ms
3188 KB
1_05.txt
AC
19 ms
3188 KB
1_06.txt
AC
20 ms
3568 KB
1_07.txt
AC
20 ms
3568 KB
1_08.txt
AC
20 ms
3568 KB
1_09.txt
AC
20 ms
3696 KB
1_10.txt
AC
16 ms
2292 KB
1_11.txt
AC
16 ms
2292 KB
1_12.txt
AC
16 ms
2292 KB
1_13.txt
AC
16 ms
2292 KB
1_14.txt
AC
16 ms
2292 KB
1_15.txt
AC
16 ms
2292 KB
1_16.txt
AC
16 ms
2292 KB
1_17.txt
AC
16 ms
2292 KB
1_18.txt
AC
23 ms
3188 KB
1_19.txt
AC
19 ms
2420 KB
1_20.txt
AC
22 ms
3188 KB
1_21.txt
AC
25 ms
3568 KB
1_22.txt
AC
23 ms
3440 KB
1_23.txt
AC
23 ms
3060 KB
1_24.txt
AC
23 ms
3440 KB
1_25.txt
AC
22 ms
3060 KB
1_26.txt
AC
12 ms
768 KB
1_27.txt
AC
11 ms
768 KB
1_28.txt
AC
12 ms
896 KB
1_29.txt
AC
13 ms
896 KB
1_30.txt
AC
19 ms
3060 KB
1_31.txt
AC
19 ms
3060 KB
1_32.txt
AC
16 ms
2164 KB
1_33.txt
AC
26 ms
3060 KB
1_34.txt
AC
16 ms
1656 KB
1_35.txt
AC
18 ms
2036 KB
1_36.txt
AC
15 ms
1528 KB
1_37.txt
AC
18 ms
2036 KB
1_38.txt
AC
22 ms
3060 KB
1_39.txt
AC
22 ms
3188 KB
1_40.txt
AC
23 ms
3312 KB
1_41.txt
AC
26 ms
3568 KB
1_42.txt
AC
12 ms
768 KB
1_43.txt
AC
12 ms
768 KB
1_44.txt
AC
12 ms
896 KB
1_45.txt
AC
12 ms
768 KB
1_46.txt
AC
14 ms
1404 KB
1_47.txt
AC
16 ms
1912 KB
1_48.txt
AC
15 ms
1656 KB
1_49.txt
AC
22 ms
3188 KB
1_50.txt
AC
12 ms
896 KB
1_51.txt
AC
12 ms
768 KB
1_52.txt
AC
13 ms
1148 KB
1_53.txt
AC
13 ms
896 KB
1_54.txt
AC
19 ms
3188 KB
1_55.txt
AC
15 ms
1912 KB
1_56.txt
AC
20 ms
3188 KB
1_57.txt
AC
23 ms
3188 KB
1_58.txt
AC
11 ms
768 KB
1_59.txt
AC
11 ms
768 KB
1_60.txt
AC
11 ms
768 KB
1_61.txt
AC
11 ms
768 KB
1_62.txt
AC
14 ms
1656 KB
1_63.txt
AC
18 ms
3188 KB
1_64.txt
AC
13 ms
1528 KB
1_65.txt
AC
21 ms
3060 KB
1_66.txt
AC
11 ms
768 KB
1_67.txt
AC
11 ms
768 KB
1_68.txt
AC
11 ms
768 KB
1_69.txt
AC
11 ms
768 KB
1_70.txt
AC
18 ms
3188 KB
1_71.txt
AC
20 ms
3060 KB