Comments

• 
  

  0

  

  ngoccaidu2008  commented on Nov. 14, 2025, 3:58 a.m.

  code tham khao python

  n,q=map(int,input().split())
  S=[0]*(n+1)
  for  i in range(q):
      a,b=map(int, input().split())
      S[a-1]+=1
      S[b]+= -1
  
  def danhsach(S):
      A=[0]*n
      A[0]=S[0]
      for i in range(1,n):
          A[i]=A[i-1]+S[i]
      return A
  A=danhsach(S)
  for i in range(n):
      print(A[i]%2,end=" ")
  

• 
  

  0

  

  ngoccaidu2008  commented on Oct. 17, 2025, 10:04 a.m.

  bài này dùng difference array + prefix sum

  #pragma GCC optimize("O2")
  #pragma GCC target("avx,avx2,fma")
  #include <bits/stdc++.h>
  using namespace std;
  #define __Hormer_Nguyen__ signed main()
  #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
  const int maxn=5+1e5;
  int n,q,a[maxn],sum=0;
  __Hormer_Nguyen__
  {
      ios::sync_with_stdio(false);
      cin.tie(0);
      cin>>n>>q;
      while (q--)
      {
          int l,r;cin>>l>>r;
          a[l]++;
          a[r+1]--;
      }for (int i=1;i<=n;i++)
      {
          sum+=a[i];
          cout<<sum%2;
          cout<<" ";
      }
  }
  

• 
  

  -1

  

  aunl19  commented on Aug. 8, 2025, 2:36 a.m.

  mảng đánh dấu