oj.uz

답안 #141026

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
141026 2019-08-06T11:42:46 Z cheetose 스파이 (JOI13_spy) C++11
100 / 100
 292 ms 36380 KB 
#include<cstdio>
#include<cstdlib>
#include<iostream>
#include<vector>
#include<queue>
#include<bitset>
#include<string>
#include<stack>
#include<set>
#include<unordered_set>
#include<map>
#include<unordered_map>
#include<cstring>
#include<complex>
#include<cmath>
#include<iomanip>
#include<numeric>
#include<algorithm>
#include<list>
#include<functional>
#include<cassert>
#define mp make_pair
#define pb push_back
#define X first
#define Y second
#define y0 y12
#define y1 y22
#define INF 987654321987654321
#define PI 3.141592653589793238462643383279502884
#define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
#define fdn(i,a,b,c) for(int (i)=(a);(i)>=(b);(i)-=(c))
#define MEM0(a) memset((a),0,sizeof(a));
#define MEM_1(a) memset((a),-1,sizeof(a));
#define ALL(a) a.begin(),a.end()
#define SYNC ios_base::sync_with_stdio(false);cin.tie(0)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int, int> Pi;
typedef pair<ll, ll> Pll;
typedef pair<ld, ld> Pd;
typedef vector<int> Vi;
typedef vector<ll> Vll;
typedef vector<double> Vd;
typedef vector<Pi> VPi;
typedef vector<Pll> VPll;
typedef vector<Pd> VPd;
typedef tuple<int, int, int> iii;
typedef tuple<int,int,int,int> iiii;
typedef tuple<ll, ll, ll> LLL;
typedef vector<iii> Viii;
typedef vector<LLL> VLLL;
typedef complex<double> base;
const ll MOD = 998244353;
ll POW(ll a, ll b, ll MMM = MOD) {ll ret=1; for(;b;b>>=1,a=(a*a)%MMM)if(b&1)ret=(ret*a)% MMM; return ret; }
ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
ll lcm(ll a, ll b) { if (a == 0 || b == 0)return a + b; return a*(b / gcd(a, b)); }
int dx[] = { 0,1,0,-1,1,1,-1,-1 }, dy[] = { 1,0,-1,0,1,-1,1,-1 };

int n,m;
int par1[2001],par2[2001];
int d[2001][2001],cnt[2001][2001];
int go(int i,int j)
{
	if(i==0 || j==0)return 0;
	int &ret=d[i][j];
	if(ret!=-1)return ret;
	return ret=cnt[i][j]+go(par1[i],j)+go(i,par2[j])-go(par1[i],par2[j]);
}
int main() {
	MEM_1(d);
	int n,m;
	scanf("%d%d",&n,&m);
	fup(i,1,n,1)
	{
		int x,y;
		scanf("%d%d",&x,&y);
		par1[i]=x,par2[i]=y;
	}
	fup(i,1,m,1)
	{
		int x,y;
		scanf("%d%d",&x,&y);
		cnt[x][y]++;
	}
	fup(i,1,n,1)printf("%d\n",go(i,i));
}

Compilation message

spy.cpp: In function 'int main()':
spy.cpp:76:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d",&n,&m);
  ~~~~~^~~~~~~~~~~~~~
spy.cpp:80:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d",&x,&y);
   ~~~~~^~~~~~~~~~~~~~
spy.cpp:86:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d",&x,&y);
   ~~~~~^~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 16504 KB Output is correct
2 Correct 19 ms 15996 KB Output is correct
3 Correct 18 ms 16248 KB Output is correct
4 Correct 16 ms 16248 KB Output is correct
5 Correct 16 ms 16508 KB Output is correct
6 Correct 15 ms 15992 KB Output is correct
7 Correct 16 ms 16632 KB Output is correct
8 Correct 16 ms 16504 KB Output is correct
9 Correct 15 ms 15992 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 126 ms 22272 KB Output is correct
2 Correct 123 ms 16248 KB Output is correct
3 Correct 22 ms 19412 KB Output is correct
4 Correct 21 ms 18300 KB Output is correct
5 Correct 28 ms 21880 KB Output is correct
6 Correct 25 ms 16248 KB Output is correct
7 Correct 106 ms 22264 KB Output is correct
8 Correct 34 ms 22264 KB Output is correct

Subtask #3
70.0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 284 ms 36344 KB Output is correct
2 Correct 225 ms 20736 KB Output is correct
3 Correct 133 ms 32464 KB Output is correct
4 Correct 137 ms 36380 KB Output is correct
5 Correct 175 ms 36092 KB Output is correct
6 Correct 118 ms 21088 KB Output is correct
7 Correct 292 ms 36088 KB Output is correct
8 Correct 203 ms 36092 KB Output is correct