Submission #37151194

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

#define ll                      long long
#define sz(x)                   (int)((x).size())
#define all(a)                  a.begin(), a.end()


template <typename T, typename U>static inline void amin(T &x, U y){if (y < x) x = y;}
template <typename T, typename U>static inline void amax(T &x, U y){if (x < y)x = y;}
ll cdiv(ll a, ll b) { return a / b + ((a ^ b) > 0 && a % b); }
ll fdiv(ll a, ll b) { return a / b - ((a ^ b) < 0 && a % b); }


ll gcd(ll a, ll b)
{if (b == 0)
           return (a);
    else
         return (gcd(b, a % b));
}

 
//#define runSieve 
vector<bool> prime(10000005, true); 
void sieve(ll n = 10000002){
prime[1] = false;
for (ll p = 2; p * p <= n; p++)
     {if (prime[p] == true)
             for (ll i = p * p; i <= n; i += p) 
                    prime[i] = false; 
      }
}
 
//******************************************************************************************************************

void fn()
{
  ll n,t;
  cin>>n>>t;
  vector<ll>v(n);

  for(auto &x:v)cin>>x;

    vector<ll>pre(n,0);
  pre[0]=v[0];
  for(int j=1;j<n;j++)
    pre[j]=pre[j-1]+v[j];
   ll sum=pre[n-1];
   ll r=t%sum;
   if(n==1){
    cout<<"1 ";
    cout<<r<<'\n';
    return ;
   }
   if(r==0){
    cout<<"1 0\n";
    return;
   }
   // cout<<r<<'\n';
   auto itr=upper_bound(all(pre),r)-pre.begin();
   // itr--;
   cout<<itr+1<<' ';
   if(itr==0){
    cout<<r;
   }else {
    cout<<r-pre[itr-1];
   }
}

int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);


   ll TESTS = 1;
   //cin >> TESTS;
   for(int t=1;t<=TESTS;t++){
   //cout<<"Case #"<<t<<": ";
     fn();
   }
   return 0;    
}

Submission Info

Judge Result