Submission #3690737

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

#define NDEBUG
#ifdef DEBUG
#include "../cout11.h"
#undef NDEBUG
#include <cassert>

typedef long long ll;
typedef long double Double;
typedef unsigned long long ull;
typedef pair<int,int> ii;
typedef pair<ll,ll> llll;
typedef pair<double,double> dd;

typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<ll> vll;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<long double> vD;

#define sz(a)  int((a).size())
#define pb  push_back
#define FOR(var,from,to) for(int var=(from);var<=(to);++var)
#define rep(var,n)  for(int var=0;var<(n);++var)
#define rep1(var,n)  for(int var=1;var<=(n);++var)
#define repC2(vari,varj,n)  for(int vari=0;vari<(n)-1;++vari)for(int varj=vari+1;varj<(n);++varj)
#define ALL(c)  (c).begin(),(c).end()
#define RALL(c)  (c).rbegin(),(c).rend()
#define tr(i,c)  for(auto i=(c).begin(); i!=(c).end(); ++i)
#define found(s,e)  ((s).find(e)!=(s).end())
#define mset(arr,val)  memset(arr,val,sizeof(arr))
#define mid(x,y) ((x)+((y)-(x))/2)
#define IN(x,a,b) ((a)<=(x)&&(x)<=(b))
#define cons make_pair

ll gcd(ll a, ll b) { while(a) swap(a, b%=a); return b; }

const ll MOD=1000000007LL;

ll ADD(ll x, ll y) { return (x+y) % MOD; }
ll SUB(ll x, ll y) { return (x-y+MOD) % MOD; }
ll MUL(ll x, ll y) { return x*y % MOD; }
ll POW(ll x, ll e) { ll v=1; for(; e; x=MUL(x,x), e>>=1) if (e&1) v = MUL(v,x); return v; }
ll DIV(ll x, ll y) { /*assert(y%MOD!=0);*/ return MUL(x, POW(y, MOD-2)); }
// ll comb(ll n, ll k) { ll v=1; for(ll i=1; i<=k; i++) v = DIV(MUL(v, n-i+1),i); return v; }

ll solve(int N,int M,vi& A,vi& B,vi& L) {
    vector<map<int,vi>> sta(N); // [from][distance] = [to....]
        int ai=A[i], bi=B[i], li=L[i];
    ll cnt = 0;
        int ai=A[i], bi=B[i], li=L[i], ho=2540-li;
        if (li == ho) {
            cnt += sta[ai][ho].size()-1;
            cnt += sta[bi][ho].size()-1;
        } else {
            cnt += sta[ai][ho].size();
            cnt += sta[bi][ho].size();
    return cnt / 2;

int main() {
    int N, M; scanf("%d%d", &N,&M);
    vi A(M),B(M),L(M);
        scanf("%d%d%d", &A[i],&B[i],&L[i]);
        A[i]--; B[i]--;
    cout << solve(N,M,A,B,L) << endl;
    return 0;

Submission Info

Submission Time
Task A - 2540
User naoya_t
Language C++14 (GCC 5.4.1)
Score 300
Code Size 2591 Byte
Exec Time 209 ms
Memory 43520 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:81:35: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     int N, M; scanf("%d%d", &N,&M);
./Main.cpp:84:43: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d%d", &A[i],&B[i],&L[i]);

Test Cases

Set Name Score / Max Score Test Cases
Sample 0 / 0 sample_01.txt, sample_02.txt
All 300 / 300 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, sample_01.txt, sample_02.txt
Case Name Status Exec Time Memory
01.txt 96 ms 25472 KB
02.txt 209 ms 29312 KB
03.txt 26 ms 2432 KB
04.txt 26 ms 2432 KB
05.txt 188 ms 43520 KB
06.txt 53 ms 9984 KB
07.txt 57 ms 24320 KB
08.txt 1 ms 256 KB
09.txt 26 ms 3072 KB
sample_01.txt 1 ms 256 KB
sample_02.txt 1 ms 256 KB