제출 #97666

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
97666		Kalam	Simple game (IZhO17_game)	C++11	100 / 100	132 ms	6968 KiB

game

// KALAM
# include<bits/stdc++.h>

using namespace std;

const int N = 1000000 + 77;
int n , q;
int a[N] , Fen[N];
inline void Add(int x , int y){
   for(;x < N;x += x & - x)
      Fen[x] += y;
}
inline int Get(int x){
   int res = 0;
   for(;x;x -= x & - x)
      res += Fen[x];
   return res;
}
int main() {
   scanf("%d %d" , & n , & q);
   for(int i = 1;i <= n;++ i) {
      scanf("%d" , a + i);
      if(i > 1)
         Add(max(a[i] , a[i - 1]) , - 1) , Add(min(a[i] , a[i - 1]) , 1);
   }
   while(q --){
      int tp , x , y;
      scanf("%d %d" , & tp , & x);
      if(tp == 2){
         printf("%d\n" , Get(x));
         continue ;
      }
      scanf("%d" , & y);
      if(x > 1) {
         Add(max(a[x] , a[x - 1]) , 1) , Add(min(a[x] , a[x - 1]) , - 1);
         Add(max(y , a[x - 1]) , - 1) , Add(min(y , a[x - 1]) , 1);
      }
      if(x < n) {
         Add(max(a[x] , a[x + 1]) , 1) , Add(min(a[x] , a[x + 1]) , - 1);
         Add(max(y , a[x + 1]) , - 1) , Add(min(y , a[x + 1]) , 1);
      }
      a[x] = y;
   }

   return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

game.cpp: In function 'int main()':
game.cpp:20:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%d %d" , & n , & q);
    ~~~~~^~~~~~~~~~~~~~~~~~~~~
game.cpp:22:12: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
       scanf("%d" , a + i);
       ~~~~~^~~~~~~~~~~~~~
game.cpp:28:12: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
       scanf("%d %d" , & tp , & x);
       ~~~~~^~~~~~~~~~~~~~~~~~~~~~
game.cpp:33:12: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
       scanf("%d" , & y);
       ~~~~~^~~~~~~~~~~~

• Subtask 1: 22 / 22
• Subtask 2: 27 / 27
• Subtask 3: 51 / 51