Problem p02726 (C++) — buggy submission, verdict: Runtime Error

/*
 _____ _             _              _           _
|_   _| |__   ___   / \\   _ __  ___| |__  _   _| |
  | | | '_ \\ / _ \\ / _ \\ | '_ \\/ __| '_ \\| | | | |
  | | | | | |  __// ___ \\| | | \\__ \\ | | | |_| | |
  |_| |_| |_|\\___/_/   \\_\\_| |_|___/_| |_|\\__,_|_|

*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define pb push_back
#define ppb pop_back
#define endl '\\n'
#define mii map<ll, ll>
#define msi map<string, ll>
#define mis map<ll, string>
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define repr(i, a, b) for (ll i = b - 1; i >= a; i--)
#define trav(a, x) for (auto &a : x)
#define pii pair<ll, ll>
#define vi vector<ll>
#define vii vector<pair<ll, ll>>
#define vs vector<string>
#define all(a) (a).begin(), (a).end()
#define freq first
#define S second
#define sz(x) (ll) x.size()
#define hell 1000000007
#define lbnd lower_bound
#define ubnd upper_bound
#define max(a, b) (a > b ? a : b)
#define min(a, b) (a < b ? a : b)

/*	For Debugging	*/
#define DEBUG cerr << "\\n>>>I'm Here<<<\\n" << endl;
#define display(x)                                                             \\
  trav(a, x) cout << a << " ";                                                 \\
  cout << endl;
#define what_is(x) cerr << #x << " is " << x << endl;

std::mt19937_64
    rng(std::chrono::steady_clock::now().time_since_epoch().count());
#define ordered_set                                                            \\
  tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update>
#define TIME                                                                   \\
  cerr << "\\nTime elapsed: " << setprecision(5)                                \\
       << 1000.0 * clock() / CLOCKS_PER_SEC << "ms\\n";
#define DECIMAL(n)                                                             \\
  cout << fixed;                                                               \\
  cout << setprecision(n);
#define FAST                                                                   \\
  ios_base::sync_with_stdio(false);                                            \\
  cin.tie(0);                                                                  \\
  cout.tie(0);
using namespace __gnu_pbds;
using namespace std;
#define PI 3.141592653589793
#define N 100005
ll freq[N];
ll n, x, y;

ll fun(ll u, ll v) {
  return min(v - u,
             min(abs(v - x) + abs(y - u) + 1, abs(v - y) + abs(x - u) + 1));
  // if(u==x && v==y)
  // 	return 1;
  // if(v<=x || u>=y)
  // {
  // 	return (v-u);
  // }
  // if((u>x && v<y))
  // {
  // 	return min(v-u,x-u+y-v+1);
  // }
  // if((u>x && u<y))
  // {
  // 	return min(v-u,u-x+v-y+1);
  // }
  // if((v>x && v<y))
  // {
  // 	return min(v-u,y-v+x-u+1);
  // }
  // return min(x-u+v-y+1,v-u);
}

void solve() {
  cin >> n >> x >> y;
  // ll ans=0;
  rep(i, 1, n + 1) {
    rep(j, i + 1, n + 1) {
      freq[fun(i, j)]++;
      // if(fun(i,j)==5)
      // {
      // 	cout<<i<<" "<<j<<endl;
      // }
    }
  }
  rep(i, 1, n) { cout << freq[i] << endl; }
  return;
}
int main() {
  FAST int TESTS = 1;
  //	cin>>TESTS;
  while (TESTS--) {
    solve();
  }
  TIME return 0;
}

Error: 0

Time elapsed: 34.389ms


Fixed submission:

/*
 _____ _             _              _           _
|_   _| |__   ___   / \\   _ __  ___| |__  _   _| |
  | | | '_ \\ / _ \\ / _ \\ | '_ \\/ __| '_ \\| | | | |
  | | | | | |  __// ___ \\| | | \\__ \\ | | | |_| | |
  |_| |_| |_|\\___/_/   \\_\\_| |_|___/_| |_|\\__,_|_|

*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define pb push_back
#define ppb pop_back
#define endl '\\n'
#define mii map<ll, ll>
#define msi map<string, ll>
#define mis map<ll, string>
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define repr(i, a, b) for (ll i = b - 1; i >= a; i--)
#define trav(a, x) for (auto &a : x)
#define pii pair<ll, ll>
#define vi vector<ll>
#define vii vector<pair<ll, ll>>
#define vs vector<string>
#define all(a) (a).begin(), (a).end()
#define F first
#define S second
#define sz(x) (ll) x.size()
#define hell 1000000007
#define lbnd lower_bound
#define ubnd upper_bound
#define max(a, b) (a > b ? a : b)
#define min(a, b) (a < b ? a : b)

/*	For Debugging	*/
#define DEBUG cerr << "\\n>>>I'm Here<<<\\n" << endl;
#define display(x)                                                             \\
  trav(a, x) cout << a << " ";                                                 \\
  cout << endl;
#define what_is(x) cerr << #x << " is " << x << endl;

std::mt19937_64
    rng(std::chrono::steady_clock::now().time_since_epoch().count());
#define ordered_set                                                            \\
  tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update>
#define TIME                                                                   \\
  cerr << "\\nTime elapsed: " << setprecision(5)                                \\
       << 1000.0 * clock() / CLOCKS_PER_SEC << "ms\\n";
#define DECIMAL(n)                                                             \\
  cout << fixed;                                                               \\
  cout << setprecision(n);
#define FAST                                                                   \\
  ios_base::sync_with_stdio(false);                                            \\
  cin.tie(0);                                                                  \\
  cout.tie(0);
using namespace __gnu_pbds;
using namespace std;
#define PI 3.141592653589793
#define N 100005
ll f[N];
ll n, x, y;

ll fun(ll u, ll v) {
  if (u == x && v == y)
    return 1;
  if (v <= x || u >= y || (u > x && v < y)) {
    return (v - u);
  }
  if ((u > x && u < y)) {
    return min(v - u, u - x + v - y + 1);
  }
  if ((v > x && v < y)) {
    return min(v - u, y - v + x - u + 1);
  }
  return min(x - u + v - y + 1, v - u);
}

void solve() {
  cin >> n >> x >> y;
  ll ans = 0;
  rep(i, 1, n + 1) {
    rep(j, 1, n + 1) {
      f[fun(i, j)]++;
      // if(fun(i,j)==5)
      // {
      // 	cout<<i<<" "<<j<<endl;
      // }
    }
  }
  rep(i, 1, n) { cout << f[i] << endl; }
  return;
}
int main() {
  FAST int TESTS = 1;
  //	cin>>TESTS;
  while (TESTS--) {
    solve();
  }
  TIME return 0;
}