제출 #1284964

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1284964		limon4ick	Pairs (IOI07_pairs)	C++20	29 / 100	4094 ms	2624 KiB

pairs

/*#pragma GCC optimize("Ofast,no-stack-protector,unroint-loops,fast-math,O3")
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroint-loops")
#pragma ("reroint") */
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define ins insert
#define F first
#define S second
const int mod = 1e9 + 7,N = 1e6 + 100,mx = 1e9 + 7;
signed main(){
    //freopen("justcoding.in","r",stdin);
    //freopen("justcoding.out","w",stdout);
    std::ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int t,n,d,m;
    cin >> t >> n >> d >> m;
    if(t==1){
        int a[n + 1];
        for(int i = 1;i<=n;i++){
            cin >> a[i];
        }
        int cnt = 0;
        for(int i = 1;i<=n;i++){
            for(int j = i + 1;j<=n;j++){
                if(abs(a[j]-a[i])<=d) cnt++;
            }
        }
        cout << cnt << '\n';
    }
    else if(t==2){
        int a[n + 1];
        int b[n + 1];
        for(int i = 1; i <= n;i++){
            cin >> a[i] >> b[i];
        }
        int cnt = 0;
        for(int i = 1;i<=n;i++){
            for(int j = i + 1;j<=n;j++){
                if(abs(b[j] - b[i]) + abs(a[j] - a[i]) <= d){
                    cnt++;
                }
            }
        }
        cout << cnt << '\n';
    }
    else{
        int a[n + 1],b[n + 1],c[n + 1];
        for(int i = 1;i<=n;i++){
            cin >> a[i] >> b[i] >> c[i];
        }
        int cnt = 0;
        for(int i = 1;i<=n;i++){
            for(int j = i + 1;j<=n;j++){
                if(abs(b[j] - b[i]) + abs(a[j] - a[i]) + abs(c[j] - c[i]) <= d){
                    cnt++;
                }
            }
        }
        cout << cnt << '\n';
    }
}

• Subtask 1: 6 / 6
• Subtask 2: 6 / 6
• Subtask 3: 0 / 6
• Subtask 4: 0 / 6
• Subtask 5: 0 / 6
• Subtask 6: 7 / 7
• Subtask 7: 0 / 7
• Subtask 8: 0 / 8
• Subtask 9: 0 / 8
• Subtask 10: 10 / 10
• Subtask 11: 0 / 10
• Subtask 12: 0 / 10
• Subtask 13: 0 / 10