Submission #68117068


Source Code Expand

#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <tuple>
#include <typeinfo>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using ll = long long;
using ld = long double;
using namespace std;
#define endl "\n";
#define ff first
#define ss second

#define forn(i,n) for(int i=0;i<n;i++)
#define dbgv(v) cout<<#v<<" "<<v<<endl
#define dbga(a,n) forn(i,n-1) {cout<<a[i]<<' ';} cout<<a[n-1]<<'\n';
#define all(v) (v).begin(), (v).end()


const ll N = 1e6 + 5, mod = 1e9 + 7;
ll fact[N], modinv[N];

ll fastpow(ll n, ll m) {
    int ret = 1;
    while (m) {
        if (m & 1)
            (ret *= n) %= mod;
        (n *= n) %= mod;
        m /= 2;
    }
    return ret;
}

void pre() {
    fact[0] = 1;
    for (int i = 1; i < N; i++)
        fact[i] = i * fact[i - 1] % mod;
    modinv[N - 1] = fastpow(fact[N - 1], mod - 2);
    for (int i = N - 2; i >= 0; i--)
        modinv[i] = (i + 1) * modinv[i + 1] % mod;
}

ll ncr(ll n, ll r) {
    return fact[n] * modinv[n - r] % mod * modinv[r] % mod;
}

void dfs(int i,int p, vector<vector<int>>&adj){
	for(auto c:adj[i]){
		dfs(c,i,adj);
	}
}

void solve(){
    ll n;
    cin>>n;
    ll a[n]; 
    forn(i,n){
        cin>>a[i];
    }
    map<ll,ll> v;
    ll ans=0;
    forn(i,n){
        ans+=v[(a[i]-i)];
        v[-i-a[i]]++;
    }
    cout<<ans<<endl;
}

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

    int T = 1;
    // cin >> T;
    while(T--){
        solve();
    }
    return 0;
}

Submission Info

Submission Time
Task C - Distance Indicators
User SummitDevil
Language C++ 17 (gcc 12.2)
Score 300
Code Size 2141 Byte
Status AC
Exec Time 154 ms
Memory 25640 KiB

Compile Error

Main.cpp: In function ‘void dfs(int, int, std::vector<std::vector<int> >&)’:
Main.cpp:79:20: warning: unused parameter ‘p’ [-Wunused-parameter]
   79 | void dfs(int i,int p, vector<vector<int>>&adj){
      |                ~~~~^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 3
AC × 29
Set Name Test Cases
Sample 00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt
All 00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt, 01_random_03.txt, 01_random_04.txt, 01_random_05.txt, 01_random_06.txt, 01_random_07.txt, 01_random_08.txt, 01_random_09.txt, 01_random_10.txt, 01_random_11.txt, 01_random_12.txt, 01_random_13.txt, 01_random_14.txt, 01_random_15.txt, 01_random_16.txt, 01_random_17.txt, 01_random_18.txt, 01_random_19.txt, 01_random_20.txt, 01_random_21.txt, 01_random_22.txt, 01_random_23.txt, 01_random_24.txt, 01_random_25.txt, 01_random_26.txt, 01_random_27.txt, 01_random_28.txt
Case Name Status Exec Time Memory
00_sample_00.txt AC 1 ms 3464 KiB
00_sample_01.txt AC 1 ms 3600 KiB
00_sample_02.txt AC 1 ms 3480 KiB
01_random_03.txt AC 80 ms 15856 KiB
01_random_04.txt AC 103 ms 17832 KiB
01_random_05.txt AC 54 ms 12804 KiB
01_random_06.txt AC 114 ms 18644 KiB
01_random_07.txt AC 151 ms 22112 KiB
01_random_08.txt AC 149 ms 22068 KiB
01_random_09.txt AC 154 ms 22124 KiB
01_random_10.txt AC 142 ms 22160 KiB
01_random_11.txt AC 48 ms 16676 KiB
01_random_12.txt AC 10 ms 6176 KiB
01_random_13.txt AC 45 ms 14512 KiB
01_random_14.txt AC 9 ms 6136 KiB
01_random_15.txt AC 56 ms 17536 KiB
01_random_16.txt AC 59 ms 12912 KiB
01_random_17.txt AC 34 ms 9448 KiB
01_random_18.txt AC 3 ms 4116 KiB
01_random_19.txt AC 42 ms 10940 KiB
01_random_20.txt AC 77 ms 15280 KiB
01_random_21.txt AC 71 ms 15184 KiB
01_random_22.txt AC 80 ms 15320 KiB
01_random_23.txt AC 57 ms 15452 KiB
01_random_24.txt AC 83 ms 25640 KiB
01_random_25.txt AC 44 ms 15788 KiB
01_random_26.txt AC 44 ms 15948 KiB
01_random_27.txt AC 44 ms 15912 KiB
01_random_28.txt AC 44 ms 15848 KiB