提出 #54077318
ソースコード 拡げる
/*
Author : Gogal vijay
Title:Dynamic subarray sum
*/
#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 solve() {
int n, l, r;
cin >> n >> l >> r;
for (int i = 1; i < l;i++)
cout << i << ' ';
for (int i = r; i >= l;i--)
cout << i << ' ';
for (int i = r + 1; i <= n;i++)
cout << i << ' ';
}
int main()
{
int t=1;
//cin>>t;
while(t--){
solve();
}
return 0;
}
提出情報
コンパイルエラー
Main.cpp: In function ‘std::string to_string(std::string, int, int)’:
Main.cpp:23:23: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::__cxx11::basic_string<char>::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
23 | return '"' + ((x1 < s.size()) ? s.substr(x1, x2-x1+1) : "") + '"';
| ~~~^~~~~~~~~~
ジャッジ結果
| セット名 |
Sample |
All |
| 得点 / 配点 |
0 / 0 |
100 / 100 |
| 結果 |
|
|
| セット名 |
テストケース |
| Sample |
sample_01.txt, sample_02.txt, sample_03.txt |
| All |
sample_01.txt, sample_02.txt, sample_03.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt, test_08.txt, test_09.txt, test_10.txt, test_11.txt, test_12.txt, test_13.txt, test_14.txt, test_15.txt |
| ケース名 |
結果 |
実行時間 |
メモリ |
| sample_01.txt |
AC |
1 ms |
3560 KiB |
| sample_02.txt |
AC |
1 ms |
3484 KiB |
| sample_03.txt |
AC |
1 ms |
3644 KiB |
| test_01.txt |
AC |
1 ms |
3488 KiB |
| test_02.txt |
AC |
1 ms |
3640 KiB |
| test_03.txt |
AC |
1 ms |
3424 KiB |
| test_04.txt |
AC |
1 ms |
3468 KiB |
| test_05.txt |
AC |
1 ms |
3460 KiB |
| test_06.txt |
AC |
1 ms |
3420 KiB |
| test_07.txt |
AC |
1 ms |
3552 KiB |
| test_08.txt |
AC |
1 ms |
3356 KiB |
| test_09.txt |
AC |
1 ms |
3452 KiB |
| test_10.txt |
AC |
1 ms |
3488 KiB |
| test_11.txt |
AC |
1 ms |
3488 KiB |
| test_12.txt |
AC |
1 ms |
3460 KiB |
| test_13.txt |
AC |
1 ms |
3420 KiB |
| test_14.txt |
AC |
1 ms |
3612 KiB |
| test_15.txt |
AC |
1 ms |
3452 KiB |