Submission

Score: 100

User: GastrointestinalTrackInflammation

Problemset: Croissant Express

Language: cpp

Time: 0.002 second

Submitted On: 2026-10-06 15:06:30

#include<bits/stdc++.h>

using namespace std;

#define inall(x) for(auto& i:x)cin>>i;
#define outall(x) {for(auto i:x)cout<<i<<' ';cout<<endl;}
#define ini(x,y) for(auto& i:x)i=y;
#define tout(x) cout<<"DEBUG! :"<<x<<endl;
#define rout(x) {cout<<x<<endl;return;}
using ll = long long;
using df = double;

template<typename pair1,typename pair2>
istream& operator>>(istream& in,pair<pair1,pair2>&p) {return in>>p.first>>p.second;}

template <typename pair1, typename pair2>
ostream& operator<<(ostream& out,const pair<pair1,pair2>&p) {return out<<endl<<p.first<<' '<< p.second;}

const ll mod=10007;

void solve(){
    int n,t,e;
    cin>>n>>t>>e;
    ll a[n][2];
    vector<vector<bool>>ispass(n,vector<bool>(2,0));
    for(int i=0;i<n;i++){
        cin>>a[i][0]>>a[i][1];
    }
    ll sum=0,prod=1;
    int j=0,b=t;
    for(int i=0;i<n;i++){
        ispass[i][j]=1;
        if(a[i][j]<=0)continue;
        sum+=a[i][j];
        sum%=mod;
        b--;
        if(b==0){
            b=t;
            j=1-j;
        }
    }
    j=1,b=e;
    for(int i=0;i<n;i++){
        ispass[i][j]=1;
        if(a[i][j]<=0)continue;
        prod*=a[i][j];
        prod%=mod;
        b--;
        if(b==0){
            b=e;
            j=1-j;
        }
    }
    int maxstreak=0,curstreak=0;
    for(int i=0;i<n;i++){
        if(!ispass[i][0])curstreak++;
        else curstreak=0;
        maxstreak=max(maxstreak,curstreak);
    }
    for(int i=0;i<n;i++){
        if(!ispass[i][1])curstreak++;
        else curstreak=0;
        maxstreak=max(maxstreak,curstreak);
    }
    cout<<sum<<' '<<prod<<' '<<maxstreak<<endl;
}

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);cout.tie(nullptr);
    int t=1;
    //cin>>t;
    while(t--)solve();
    return 0;
}