Submission #66811984


Source Code Expand

Copy
/*
T = 1
def init():
global T
T = _I()
def psl(a,b,x,y):
if a-b < x-y:
return psl(x,y,a,b)[::-1]
for s in _R(1,10**7):
t=b*s//y+1
if (a*s>x*t):
return s,t
return -1,-1
def solve():
N = _I()
A = _L()
B = _L()
p = max([(A[i]-B[i],i) for i in _R(N)])
q = min([(A[i]-B[i],i) for i in _R(N)])
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
/*
T = 1

def init():
    global T
    T = _I()
def psl(a,b,x,y):
    if a-b < x-y:
        return psl(x,y,a,b)[::-1]
    for s in _R(1,10**7):
        t=b*s//y+1
        if (a*s>x*t):
            return s,t
    return -1,-1

def solve():
    N = _I()
    A = _L()
    B = _L()
    p = max([(A[i]-B[i],i) for i in _R(N)])
    q = min([(A[i]-B[i],i) for i in _R(N)])
    yn(p[0] != q[0])
    if p[0] != q[0]:
        x,y = psl(A[p[1]],B[p[1]],A[q[1]],B[q[1]])
        k = [0]*N
        k[p[1]] = x
        k[q[1]] = -y
        print(*k)

import sys
import math
from copy import deepcopy as dc
sys.setrecursionlimit(10 ** 6)
from collections import defaultdict as dd
import heapq
from itertools import permutations as per
_S = input;_R = range;_P = print; _E = enumerate;
def _RR(a): return range(a-1,-1,-1)
def _I(): return int(_S())
def _M(): return map(int, _S().split())
def _SS(): return _S().strip().split()
def _L(): return list(_M())
def _LS(): return list(_S())
def _T(): return tuple(_M())
def yn(b): print("Yes" if b else "No")
*/

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

int T = 1;

int _I() {
    int x;
    cin >> x;
    return x;
}

vector<int> _L(int N) {
    vector<int> a(N);
    for (int i = 0; i < N; ++i) cin >> a[i];
    return a;
}

void yn(bool b) {
    cout << (b ? "Yes" : "No") << endl;
}

// Direct translation of the Python `psl` function
pair<int, int> psl(int a, int b, int x, int y) {
    if (a - b < x - y) {
        auto res = psl(x, y, a, b);
        return {res.second, res.first}; // reverse
    }
    for (int s = 1; s < 10000000; ++s) {
        int t = b * s / y + 1;
        if (a * s > x * t) {
            return {s, t};
        }
    }
    return {-1, -1};
}

void solve() {
    int N = _I();
    vector<int> A = _L(N);
    vector<int> B = _L(N);
    pair<int, int> p = {-1e18, -1}, q = {1e18, -1};

    for (int i = 0; i < N; ++i) {
        int diff = A[i] - B[i];
        if (diff > p.first) p = {diff, i};
        if (diff < q.first) q = {diff, i};
    }

    yn(p.first != q.first);
    if (p.first != q.first) {
        auto [x, y] = psl(A[p.second], B[p.second], A[q.second], B[q.second]);
        vector<int> k(N, 0);
        k[p.second] = x;
        k[q.second] = -y;
        for (int i = 0; i < N; ++i) cout << k[i] << " ";
        cout << endl;
    }
}

signed main() {
    // INIT
    T = _I();
    for (int i = 0; i < T; ++i) solve();
    return 0;
}

Submission Info

Submission Time
Task A - Dot Product
User potat_p
Language C++ 20 (gcc 12.2)
Score 0
Code Size 2546 Byte
Status WA
Exec Time 3314 ms
Memory 6924 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 500
Status
AC × 1
AC × 17
WA × 8
TLE × 20
Set Name Test Cases
Sample 00_sample_00.txt
All 00_sample_00.txt, 01_handmade_00.txt, 01_handmade_01.txt, 01_handmade_02.txt, 01_handmade_03.txt, 01_handmade_04.txt, 01_handmade_05.txt, 01_handmade_06.txt, 01_handmade_07.txt, 01_handmade_08.txt, 01_handmade_09.txt, 01_handmade_10.txt, 01_handmade_11.txt, 01_handmade_12.txt, 01_handmade_13.txt, 01_handmade_14.txt, 01_handmade_15.txt, 01_handmade_16.txt, 01_handmade_17.txt, 01_handmade_18.txt, 01_handmade_19.txt, 01_handmade_20.txt, 01_handmade_21.txt, 01_handmade_22.txt, 01_handmade_23.txt, 01_handmade_24.txt, 01_handmade_25.txt, 02_No_00.txt, 02_No_01.txt, 02_No_02.txt, 02_No_03.txt, 03_Yes_00.txt, 03_Yes_01.txt, 03_Yes_02.txt, 03_Yes_03.txt, 03_Yes_04.txt, 03_Yes_05.txt, 03_Yes_06.txt, 03_Yes_07.txt, 04_YesNo_00.txt, 04_YesNo_01.txt, 04_YesNo_02.txt, 04_YesNo_03.txt, 04_YesNo_04.txt, 04_YesNo_05.txt
Case Name Status Exec Time Memory
00_sample_00.txt AC 1 ms 3612 KiB
01_handmade_00.txt WA 472 ms 3456 KiB
01_handmade_01.txt TLE 3310 ms 3228 KiB
01_handmade_02.txt TLE 3311 ms 3252 KiB
01_handmade_03.txt TLE 3311 ms 3380 KiB
01_handmade_04.txt TLE 3313 ms 3152 KiB
01_handmade_05.txt TLE 3311 ms 3304 KiB
01_handmade_06.txt AC 270 ms 3472 KiB
01_handmade_07.txt TLE 3314 ms 3284 KiB
01_handmade_08.txt AC 270 ms 3384 KiB
01_handmade_09.txt TLE 3311 ms 3232 KiB
01_handmade_10.txt AC 268 ms 3468 KiB
01_handmade_11.txt TLE 3311 ms 3284 KiB
01_handmade_12.txt AC 268 ms 3324 KiB
01_handmade_13.txt TLE 3314 ms 3376 KiB
01_handmade_14.txt WA 181 ms 3388 KiB
01_handmade_15.txt WA 180 ms 3424 KiB
01_handmade_16.txt WA 182 ms 3520 KiB
01_handmade_17.txt WA 181 ms 3456 KiB
01_handmade_18.txt AC 272 ms 3516 KiB
01_handmade_19.txt AC 443 ms 3468 KiB
01_handmade_20.txt AC 269 ms 3456 KiB
01_handmade_21.txt AC 268 ms 3528 KiB
01_handmade_22.txt AC 203 ms 3340 KiB
01_handmade_23.txt AC 197 ms 3540 KiB
01_handmade_24.txt AC 208 ms 3424 KiB
01_handmade_25.txt AC 73 ms 3480 KiB
02_No_00.txt AC 285 ms 3528 KiB
02_No_01.txt TLE 3311 ms 3284 KiB
02_No_02.txt WA 160 ms 5784 KiB
02_No_03.txt WA 160 ms 5080 KiB
03_Yes_00.txt TLE 3310 ms 3176 KiB
03_Yes_01.txt TLE 3310 ms 3208 KiB
03_Yes_02.txt AC 73 ms 6260 KiB
03_Yes_03.txt AC 73 ms 5524 KiB
03_Yes_04.txt WA 132 ms 6924 KiB
03_Yes_05.txt AC 75 ms 6800 KiB
03_Yes_06.txt TLE 3310 ms 3224 KiB
03_Yes_07.txt TLE 3310 ms 3224 KiB
04_YesNo_00.txt TLE 3310 ms 3252 KiB
04_YesNo_01.txt TLE 3310 ms 3292 KiB
04_YesNo_02.txt TLE 3310 ms 3224 KiB
04_YesNo_03.txt TLE 3310 ms 3216 KiB
04_YesNo_04.txt TLE 3310 ms 3248 KiB
04_YesNo_05.txt TLE 3310 ms 3252 KiB


2025-08-23 (Sat)
00:29:57 +09:00