Submission #32558210


Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define n_l '\n'
#define dbg(...) cout << "[" << #__VA_ARGS__ << "]: "; cout << to_string(__VA_ARGS__) << endl
template <typename T, size_t N> 
int SIZE(const T (&t)[N])
{ 
    return N; 
} 
template<typename T> 
int SIZE(const T &t)
{ 
    return t.size(); 
} 
string to_string(const string s, int x1=0, int x2=1e9)
{ 
    return '"' + ((x1 < s.size()) ? s.substr(x1, x2-x1+1) : "") + '"'; 
} 
string to_string(const char* s) 
{ 
    return to_string((string) s); 
} 
string to_string(const bool b) 
{ 
    return (b ? "true" : "false"); 
} 
string to_string(const char c)
{ 
    return string({c}); 
} 
template<size_t N> 
string to_string(const bitset<N> &b, int x1=0, int x2=1e9)
{ 
    string t = ""; 
    for(int __iii__ = min(x1,SIZE(b)),  __jjj__ = min(x2, SIZE(b)-1); __iii__ <= __jjj__; ++__iii__)
    { 
        t += b[__iii__] + '0'; 
    } 
    return '"' + t + '"'; 
} 
template <typename A, typename... C> 
string to_string(const A (&v), int x1=0, int x2=1e9, C... coords); 
int l_v_l_v_l = 0, t_a_b_s = 0; 
template <typename A, typename B> 
string to_string(const pair<A, B> &p) 
{ 
    l_v_l_v_l++; 
    string res = "(" + to_string(p.first) + ", " + to_string(p.second) + ")"; l_v_l_v_l--; 
    return res; 
} 
template <typename A, typename... C> 
string to_string(const A (&v), int x1, int x2, C... coords) 
{ 
    int rnk = rank<A>::value; string tab(t_a_b_s, ' '); 
    string res = ""; 
    bool first = true; 
    if(l_v_l_v_l == 0) 
        res += n_l; 
   res += tab + "["; 
   x1 = min(x1, SIZE(v)), x2 = min(x2, SIZE(v)); 
   auto l = begin(v); 
   advance(l, x1); 
   auto r = l; 
   advance(r, (x2-x1) + (x2 < SIZE(v))); 
   for (auto e = l; e != r; e = next(e)) 
   { 
        if (!first)
        { 
            res += ", "; 
        } 
        first = false; 
        l_v_l_v_l++; 
        if(e != l)
        { 
            if(rnk > 1) 
            {
                 res += n_l; 
                 t_a_b_s = l_v_l_v_l; 
            }; 
       } 
       else{
        t_a_b_s = 0; 
      } 
      res += to_string(*e, coords...); 
      l_v_l_v_l--; 
    } 
    res += "]"; 
    if(l_v_l_v_l == 0) 
        res += n_l; 
    return res; 
} 
void dbgm(){;} 
template<typename Heads, typename... Tails> 
void dbgm(Heads H, Tails... T)
{ 
    cout << to_string(H) << " | "; dbgm(T...); 
} 
#define dbgm(...) cout << "[" << #__VA_ARGS__ << "]: "; dbgm(__VA_ARGS__); cout << endl
void prepare(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    // #ifndef ONLINE_JUDGE
        // freopen("input.txt", "r", stdin);
        // freopen("output.txt", "w", stdout);
    // #endif 
}
void solve(){
    int n;
    cin>>n;
    vector<pair<int,int>>a(n);
    for(int i=0;i<n;i++)
        cin>>a[i].first>>a[i].second;
    sort(a.begin(),a.end());
    vector<pair<int,int>>res;
    int s=a[0].first,e=a[0].second;
    for(int i=1;i<n;i++){
        if(a[i].first<=e)
            e=max(e,a[i].second);
        else{
            res.push_back({s,e});
            s=a[i].first;
            e=a[i].second;
        }
    }
    res.push_back({s,e});
    for(auto x:res)
        cout<<x.first<<' '<<x.second<<'\n';
}
int main() {
    int t=1;
    //cin>>t;
    while(t--)
        solve();
}



Submission Info

Submission Time
Task D - Union of Interval
User Gogalvijay
Language C++ (GCC 9.2.1)
Score 400
Code Size 3419 Byte
Status AC
Exec Time 106 ms
Memory 4796 KiB

Compile Error

./Main.cpp: In function ‘std::string to_string(std::string, int, int)’:
./Main.cpp:18:23: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::__cxx11::basic_string<char>::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
   18 |     return '"' + ((x1 < s.size()) ? s.substr(x1, x2-x1+1) : "") + '"';
      |                    ~~~^~~~~~~~~~

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 400 / 400
Status
AC × 2
AC × 24
Set Name Test Cases
Sample sample_01.txt, sample_02.txt
All random_01.txt, random_02.txt, random_03.txt, random_04.txt, random_05.txt, random_06.txt, random_07.txt, random_08.txt, random_09.txt, random_10.txt, random_11.txt, random_12.txt, random_13.txt, random_14.txt, random_15.txt, random_16.txt, random_17.txt, random_18.txt, random_19.txt, random_20.txt, random_21.txt, random_22.txt, sample_01.txt, sample_02.txt
Case Name Status Exec Time Memory
random_01.txt AC 106 ms 4692 KiB
random_02.txt AC 38 ms 3676 KiB
random_03.txt AC 105 ms 4620 KiB
random_04.txt AC 97 ms 4736 KiB
random_05.txt AC 104 ms 4796 KiB
random_06.txt AC 103 ms 4584 KiB
random_07.txt AC 106 ms 4692 KiB
random_08.txt AC 53 ms 3864 KiB
random_09.txt AC 106 ms 4724 KiB
random_10.txt AC 91 ms 4372 KiB
random_11.txt AC 93 ms 4648 KiB
random_12.txt AC 3 ms 3500 KiB
random_13.txt AC 63 ms 4328 KiB
random_14.txt AC 60 ms 4056 KiB
random_15.txt AC 40 ms 3924 KiB
random_16.txt AC 101 ms 4652 KiB
random_17.txt AC 105 ms 4732 KiB
random_18.txt AC 58 ms 3792 KiB
random_19.txt AC 103 ms 4732 KiB
random_20.txt AC 57 ms 4000 KiB
random_21.txt AC 48 ms 4164 KiB
random_22.txt AC 36 ms 4108 KiB
sample_01.txt AC 4 ms 3432 KiB
sample_02.txt AC 4 ms 3528 KiB