提出 #56304073

---

ソースコード 拡げる

// #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4.1,sse4.2,avx,avx2,popcnt,tune=native")
#include <bits/stdc++.h>
using namespace std;
#define REP_(I,N) for (int I=0,END=(N);I<END;I++)
#define rREP_(I,N) for (int I=(N)-1;I>=0;I--)
#define rep_(I,S,N) for (int I=(S),END=(N);I<END;I++)
#define rrep_(I,S,N) for (int I=(N)-1,START=(S);I>=START;I--)
#define FOR_(I,S,N) for (int I=(S),END=(N);I<=END;I++)
#define rFOR_(I,S,N) for (int I=(N),START=(S);I>=START;I--)

#define DEBUG
#ifdef DEBUG
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define deputs(str) fprintf(stderr, "%s\n",str)
#else
#define debug(...)
#define deputs(str)
#endif // DEBUG
typedef unsigned long long ULL;
typedef unsigned long long ull;
typedef long long LL;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
const int INF=0x3f3f3f3f;
const LL INFF=0x3f3f3f3f3f3f3f3fll;
const LL maxn=1e6+7;
const double pi=acos(-1.0);
const double eps=1e-10;
template<typename T>inline void pr2(T x,int k=64) {REP_(i,k) printf("%d",(x>>i)&1); putchar(' ');}
template<typename T>inline void max_(T &A,T B) {(A<B) &&(A=B);}
template<typename T>inline void min_(T &A,T B) {(A>B) &&(A=B);}
inline ll fastgcd(ll a, ll b) {  // __gcd()
    if (!b||!a) return a|b;
    ll az=__builtin_ctzll(a),bz=__builtin_ctzll(b),z=min(az,bz),diff; b>>=bz;
    while (a) {
        a>>=az, diff=b-a, az=__builtin_ctzll(diff);
        (b>a)&&(b=a), a=abs(diff);
    }
    return b<<z;
}
int startTime;
void startTimer() {startTime=clock();}
void printTimer() {debug("/--- Time: %ld milliseconds ---/\n",clock()-startTime);}
typedef array<int,5> ar5;
typedef array<int,4> ar4;
typedef array<int,3> ar3;
std::mt19937 rng(time(0));
std::mt19937_64 rng64(time(0));
vector<pii> direction4 = {{-1,0},{0,-1},{0,1},{1,0}};
vector<pii> direction8 = {{-1,-1},{-1,0},{1,1},{0,-1},{0,1},{1,-1},{1,0},{1,1}};

// const int mod = 1e9+7;
const int mod=998244353;
struct mint {
    long long x;
    mint():x(0) {}
    mint(long long x):x((x%mod+mod)%mod) {}
    // mint(long long x):x(x){}
    mint &fix() { x = (x%mod+mod)%mod; return *this; }
    mint operator-() const { return mint(0) - *this; }
    mint operator~() const { return mint(1) / *this; }
    mint &operator+=(const mint &a) { if ((x+=a.x)>=mod) x-=mod; return *this; }
    mint &operator-=(const mint &a) { if ((x+=mod-a.x)>=mod) x-=mod; return *this; }
    mint &operator*=(const mint &a) { (x*=a.x)%=mod; return *this; }
    mint &operator/=(const mint &a) { (x*=a.pow(mod-2).x)%=mod; return *this; }
    mint operator+(const mint &a)const { return mint(*this) += a; }
    mint operator-(const mint &a)const { return mint(*this) -= a; }
    mint operator*(const mint &a)const { return mint(*this) *= a; }
    mint operator/(const mint &a)const { return mint(*this) /= a; }
    mint pow(long long t) const {
        mint ret=1,cur=x;
        for (; t; t>>=1ll,cur=cur*cur)
            if (t&1) ret=ret*cur;
        return ret;
    }
    bool operator<(const mint &a)const { return x < a.x; }
    bool operator==(const mint &a)const { return x == a.x; }
};
istream & operator>>(istream &o,mint &a) { o>>a.x; a=a.fix(); return o; }
ostream & operator<<(ostream &o,const mint &a) { o<<a.x; return o; }

int solve() {
    int n;
    scanf("%d",&n);
    vector<vector<array<int,2>>> items(n+1);
    int m;
    scanf("%d",&m);
    vector<int> mark(n+1);
    vector<int> T(m+1),P(m+1);
    FOR_(i,1,m) {
        int t,p;
        scanf("%d%d",&t,&p);
        T[i]=t; P[i]=p;
        items[p].push_back({t,mark[p]});
        mark[p]^=1;
    }

    int q;
    scanf("%d",&q);
    vector<int> result(q+1);
    vector<vector<pair<int,int>>> queries(n+1);
    int B=500;
    // int B=0;
    FOR_(i,1,q) {
        int a,b;
        scanf("%d%d",&a,&b);
        if (items[a].size()<=B&&items[b].size()<=B) {
            int x=0,y=0,t=0,res=0;
            while (x<items[a].size()&&y<items[b].size()) {
                int nxt=min(items[a][x][0],items[b][y][0]);
                if (items[a][x][1]==1&&items[b][y][1]==1) res+=nxt-t+1;
                t=nxt+1;
                while (x<items[a].size()&&items[a][x][0]<=nxt) x++;
                while (y<items[b].size()&&items[b][y][0]<=nxt) y++;
            }
            // printf("%d\n",res);
            result[i]=res;
        } else {
            if (items[a].size()>=B) queries[a].push_back({b,i});
            else queries[b].push_back({a,i});
        }
    }
    vector<int> prefsum(m+1),cur(n+1);
    FOR_(t,1,n) if (queries[t].size()) {
        // printf("t=%d\n",t);
        int okay=0;
        FOR_(i,1,n) cur[i]=0,mark[i]=1;
        FOR_(i,1,m) {
            prefsum[i]=prefsum[i-1]+okay*(T[i]-T[i-1]);
            if (P[i]==t) okay^=1;
            mark[P[i]]=-mark[P[i]];
            if (mark[P[i]]==-1) cur[P[i]]-=prefsum[i];
            else cur[P[i]]+=prefsum[i];
            // printf("%d ",prefsum[i]);
        }
        // puts("<- prefsum");
        // FOR_(i,1,n) printf("%d ",cur[i]); puts("<- res");
        for (auto [r,id]:queries[t]) result[id]=cur[r];
    }
    FOR_(i,1,q) printf("%d\n",result[i]);

    return 0;
}
int main() {
    // ios_base::sync_with_stdio(false);
    // cin.tie(0), cout.tie(0);
    int T = 1;
    // cin>>T;
    // scanf("%d",&T);
    startTimer();
    FOR_(_, 1, T) { solve(); }
    // printTimer();
}
/*
*/

提出情報

コンパイルエラー

Main.cpp: In function ‘int solve()’:
Main.cpp:109:28: warning: comparison of integer expressions of different signedness: ‘std::vector<std::array<int, 2> >::size_type’ {aka ‘long unsigned int’} and ‘int’ [-Wsign-compare]
  109 |         if (items[a].size()<=B&&items[b].size()<=B) {
      |             ~~~~~~~~~~~~~~~^~~
Main.cpp:109:48: warning: comparison of integer expressions of different signedness: ‘std::vector<std::array<int, 2> >::size_type’ {aka ‘long unsigned int’} and ‘int’ [-Wsign-compare]
  109 |         if (items[a].size()<=B&&items[b].size()<=B) {
      |                                 ~~~~~~~~~~~~~~~^~~
Main.cpp:111:21: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::vector<std::array<int, 2> >::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
  111 |             while (x<items[a].size()&&y<items[b].size()) {
      |                    ~^~~~~~~~~~~~~~~~
Main.cpp:111:40: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::vector<std::array<int, 2> >::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
  111 |             while (x<items[a].size()&&y<items[b].size()) {
      |                                       ~^~~~~~~~~~~~~~~~
Main.cpp:115:25: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::vector<std::array<int, 2> >::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
  115 |                 while (x<items[a].size()&&items[a][x][0]<=nxt) x++;
      |                        ~^~~~~~~~~~~~~~~~
Main.cpp:116:25: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::vector<std::array<int, 2> >::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
  116 |                 while (y<items[b].size()&&items[b][y][0]<=nxt) y++;
      |                        ~^~~~~~~~~~~~~~~~
Main.cpp:121:32: warning: comparison of integer expressions of different signedness: ‘std::vector<std::array<int, 2> >::size_type’ {aka ‘long unsigned int’} and ‘int’ [-Wsign-compare]
  121 |             if (items[a].size()>=B) queries[a].push_back({b,i});
      |                 ~~~~~~~~~~~~~~~^~~
Main.cpp:86:10: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   86 |     scanf("%d",&n);
      |     ~~~~~^~~~~~~~~
Main.cpp:89:10: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   89 |     scanf("%d",&m);
      |     ~~~~~^~~~~~~~~
Main.cpp:94:14: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   94 |         scanf("%d%d",&t,&p);
      |         ~~~~~^~~~~~~~~~~~~~
Main.cpp:101:10: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
  101 |     scanf("%d",&q);
      |     ~~~~~^~~~~~~~~
Main.cpp:108:14: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
  108 |         scanf("%d%d",&a,&b);
      |         ~~~~~^~~~~~~~~~~~~~

ジャッジ結果