Submission #2127718


Source Code Expand

// #include {{{
#include <iostream>
#include <cassert>
#include <cstring>
#include <cstdlib>
#include <cstdio>
#include <cctype>
#include <cmath>
#include <ctime>
#include <queue>
#include <set>
#include <map>
#include <stack>
#include <string>
#include <bitset>
#include <vector>
#include <complex>
#include <algorithm>
using namespace std;
// }}}
// #define {{{
typedef long long ll;
typedef double db;
typedef pair<int,int> pii;
typedef vector<int> vi;
#define de(x) cout << #x << "=" << x << endl
#define rep(i,a,b) for(int i=a;i<(b);++i)
#define per(i,a,b) for(int i=(b)-1;i>=(a);--i)
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define fi first
#define se second
// }}}

const int N = 1e5 + 10;
int n , m , Q , a[N] , v[N] , _;
int vis[N] , cnt[N] , pos[N];

int main(){
  scanf("%d%d%d",&n,&m,&Q);
  rep(i,0,Q) scanf("%d",a + i);
  reverse(a,a+Q);
  rep(i,0,Q) {
    if(!vis[a[i]])
      vis[a[i]]=1,v[++_]=a[i];
  }
  rep(i,1,m+1) if(!vis[i])
    v[++_]=i;
  rep(i,1,m+1) pos[v[i]]=i;
  cnt[0]=n;
  int Max=0;
  rep(i,0,Q) {
    int t=pos[a[i]];
    if(cnt[t - 1]) {
      cnt[t-1]--;
      cnt[t]++;
      Max = max(Max , cnt[t]);
    } else if(Max < t) {
      puts("No");
      return 0;
    }
  }
  int Min=0;
  rep(i,0,m+1) if(cnt[i]) {
    Min=i;
    break;
  }
  int inc=true;
  rep(i,Min+2,m+1) inc&=v[i]>v[i-1];
  puts(inc ? "Yes" : "No");
  return 0;
}

Submission Info

Submission Time
Task E - LRU Puzzle
User Y_UME
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1510 Byte
Status WA
Exec Time 12 ms
Memory 2304 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:42:27: 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:43:31: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   rep(i,0,Q) scanf("%d",a + i);
                               ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 1200
Status
AC × 4
AC × 54
WA × 22
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 1 ms 256 KB
0_01.txt AC 1 ms 256 KB
0_02.txt AC 1 ms 256 KB
0_03.txt AC 1 ms 256 KB
1_00.txt AC 1 ms 256 KB
1_01.txt AC 1 ms 256 KB
1_02.txt AC 9 ms 1408 KB
1_03.txt AC 9 ms 1408 KB
1_04.txt AC 9 ms 1408 KB
1_05.txt AC 9 ms 1408 KB
1_06.txt AC 12 ms 2176 KB
1_07.txt AC 12 ms 2176 KB
1_08.txt AC 12 ms 2176 KB
1_09.txt AC 12 ms 2304 KB
1_10.txt AC 11 ms 1408 KB
1_11.txt AC 11 ms 1408 KB
1_12.txt AC 11 ms 1408 KB
1_13.txt AC 11 ms 1408 KB
1_14.txt AC 11 ms 1408 KB
1_15.txt AC 11 ms 1408 KB
1_16.txt AC 11 ms 1408 KB
1_17.txt AC 11 ms 1280 KB
1_18.txt WA 11 ms 1664 KB
1_19.txt AC 11 ms 1280 KB
1_20.txt WA 11 ms 1664 KB
1_21.txt AC 11 ms 1792 KB
1_22.txt WA 11 ms 1792 KB
1_23.txt AC 12 ms 1536 KB
1_24.txt WA 11 ms 1792 KB
1_25.txt AC 12 ms 1408 KB
1_26.txt WA 9 ms 640 KB
1_27.txt AC 9 ms 640 KB
1_28.txt WA 10 ms 640 KB
1_29.txt AC 10 ms 640 KB
1_30.txt WA 10 ms 1408 KB
1_31.txt AC 10 ms 1408 KB
1_32.txt WA 10 ms 1152 KB
1_33.txt AC 11 ms 1536 KB
1_34.txt WA 11 ms 1024 KB
1_35.txt AC 11 ms 1152 KB
1_36.txt WA 11 ms 896 KB
1_37.txt AC 11 ms 1152 KB
1_38.txt WA 11 ms 1536 KB
1_39.txt AC 11 ms 1536 KB
1_40.txt WA 11 ms 1792 KB
1_41.txt AC 12 ms 1792 KB
1_42.txt WA 9 ms 640 KB
1_43.txt AC 9 ms 640 KB
1_44.txt WA 9 ms 640 KB
1_45.txt AC 10 ms 640 KB
1_46.txt WA 10 ms 896 KB
1_47.txt AC 10 ms 1024 KB
1_48.txt WA 10 ms 1024 KB
1_49.txt AC 11 ms 1664 KB
1_50.txt WA 10 ms 640 KB
1_51.txt AC 9 ms 640 KB
1_52.txt WA 10 ms 768 KB
1_53.txt AC 10 ms 640 KB
1_54.txt WA 10 ms 1280 KB
1_55.txt AC 10 ms 896 KB
1_56.txt WA 11 ms 1536 KB
1_57.txt AC 11 ms 1664 KB
1_58.txt AC 9 ms 640 KB
1_59.txt AC 9 ms 640 KB
1_60.txt WA 9 ms 640 KB
1_61.txt AC 9 ms 640 KB
1_62.txt WA 9 ms 896 KB
1_63.txt AC 9 ms 1408 KB
1_64.txt AC 9 ms 896 KB
1_65.txt AC 11 ms 1536 KB
1_66.txt AC 9 ms 640 KB
1_67.txt AC 9 ms 640 KB
1_68.txt AC 9 ms 640 KB
1_69.txt AC 9 ms 640 KB
1_70.txt AC 9 ms 1408 KB
1_71.txt AC 11 ms 1280 KB