Submission #55069961

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include<bits/stdc++.h>
using namespace std;
#define int long long
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<pii, int> piii;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<pii> vii;
 #define INF 10000000000000000
#define inf 1000000000
// #define MOD  1000000007
// #define MOD 672804213107214
// #define MOD 998244353
#define PI 3.1415926535897932385
 #define pb push_back
#define bitc __builtin_popcountll
#define mp make_pair
#define all(ar) ar.begin(), ar.end()
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include<bits/stdc++.h>
using namespace std;
#define int long long
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<pii, int> piii;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<pii> vii;
 #define INF 10000000000000000
#define inf 1000000000
// #define MOD  1000000007
// #define MOD 672804213107214
// #define MOD 998244353
#define PI 3.1415926535897932385
 #define pb push_back
#define bitc __builtin_popcountll
#define mp make_pair
#define all(ar) ar.begin(), ar.end()
#define fr(i, a, b) for (int i = (a), _b = (b); i <= _b; i++)
#define rep(i, n) for (int i = 0, _n = (n); i < _n; i++)
#define repr(i, n) for (int i = n - 1; i >= 0; i--)
#define frr(i, a, b) for (int i = (a), _b = (b); i >= _b; i--)
#define foreach(it, ar) for (auto it = ar.begin(); it != ar.end(); it++)
#define fil(ar, val) memset(ar, val, sizeof(ar))  // 0x3f for inf, 0x80 for -INF can also use with pairs
#define print(a) for(auto x : a) cout << x << " "; cout << endl
#define print1(a) for(auto x : a) cout << x.first << " " << x.second << endl
#define print2(a,x,y)  for(int i = x; i < y; i++) cout<< a[i]<< " "; cout << endl
#define bug(...)       __f (#__VA_ARGS__, __VA_ARGS__)
 template <typename Arg1>
void __f (const char* name, Arg1&& arg1) { cout << name << " : " << arg1 << endl; }
template <typename Arg1, typename... Args>
void __f (const char* names, Arg1&& arg1, Args&&... args)
{
   const char* comma = strchr (names + 1, ',');
   cout.write (names, comma - names) << " : " << arg1 << " | "; __f (comma + 1, args...);
}
void solve()
{
  //vector<int> sieve(N+1,0); //fill constructor
    //primeSieve(sieve);
    vector<ll>vec1,vec2;
    ll n,t;
    cin>>n>>t;
    t*=10;
    t++;
    string str;
    cin>>str;
    for(int i=1;i<=n;i++)
    {
        ll x;
        cin>>x;
        if(str[i-1]=='0')
        {
            vec1.pb(x*10);
        }
        else
        {
            vec2.pb(x*10);
        }
    }
    sort(vec1.begin(),vec1.end());
    sort(vec2.begin(),vec2.end());
    ll l1=0,l2=0;
    vector<ll>vec3;
    ll sum=0;
    while(l1<vec1.size()&&l2<vec2.size())
    {
        if((vec2[l2]<vec1[l1]))
        {
            vec3.pb(vec2[l2]+(t));
            l2++;
        }
        else
        {
            auto it=upper_bound(vec3.begin(),vec3.end(),vec1[l1]-t);
            sum+=vec3.size()-(int)(it-vec3.begin());
            l1++;
        }
        // cout<<sum<<" "<<l1<<" "<<l2<<"\n";

    }
    while(l1<vec1.size())
    {
           auto it=upper_bound(vec3.begin(),vec3.end(),vec1[l1]-t);
            sum+=vec3.size()-(int)(it-vec3.begin());
            l1++;
    }
    cout<<sum;
}
signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0), cout.tie(0), cout.precision(15);   cout<<fixed;
int t=1;
// cin>>t;
while(t--)
{
   solve();
}
}

Submission Info

Compile Error

Main.cpp: In function ‘void solve()’:
Main.cpp:69:13: warning: comparison of integer expressions of different signedness: ‘ll’ {aka ‘long long int’} and ‘std::vector<long long int>::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
   69 |     while(l1<vec1.size()&&l2<vec2.size())
      |           ~~^~~~~~~~~~~~
Main.cpp:69:29: warning: comparison of integer expressions of different signedness: ‘ll’ {aka ‘long long int’} and ‘std::vector<long long int>::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
   69 |     while(l1<vec1.size()&&l2<vec2.size())
      |                           ~~^~~~~~~~~~~~
Main.cpp:85:13: warning: comparison of integer expressions of different signedness: ‘ll’ {aka ‘long long int’} and ‘std::vector<long long int>::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
   85 |     while(l1<vec1.size())
      |           ~~^~~~~~~~~~~~

Judge Result