提出 #72701600

---

ソースコード 拡げる

import java.io.*;
import java.util.*;

public class Main {
    static class Monster {
        int id;
        long x, y;
        
        Monster(int id, long x, long y) {
            this.id = id;
            this.x = x;
            this.y = y;
        }
    }

    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        PrintWriter out = new PrintWriter(System.out);
        StringTokenizer st = new StringTokenizer(br.readLine());

        int N = Integer.parseInt(st.nextToken());
        int Q = Integer.parseInt(st.nextToken());

        Monster[] monsters = new Monster[N];
        for (int i = 0; i < N; i++) {
            st = new StringTokenizer(br.readLine());
            long x = Long.parseLong(st.nextToken());
            long y = Long.parseLong(st.nextToken());
            monsters[i] = new Monster(i, x, y);
        }

        Arrays.sort(monsters, (a, b) -> {
            boolean aTop = isTop(a);
            boolean bTop = isTop(b);
            
          
            if (aTop != bTop) {
                return aTop ? -1 : 1; 
            }
            
           
            long cross = (a.x * b.y) - (a.y * b.x);
            
            if (cross == 0) return 0;
            return cross > 0 ? -1 : 1;
        });

   
        int[] monsterGroupMap = new int[N]; 
        ArrayList<Integer> groupCounts = new ArrayList<>();
        
        int currentCount = 1;
        monsterGroupMap[monsters[0].id] = 0;
        int groupIdx = 0;

        for (int i = 1; i < N; i++) {
           
            boolean sameHalf = (isTop(monsters[i]) == isTop(monsters[i-1]));
            long cross = (monsters[i].x * monsters[i-1].y) - (monsters[i].y * monsters[i-1].x);
            
            if (sameHalf && cross == 0) {
                currentCount++;
            } else {
                groupCounts.add(currentCount);
                currentCount = 1;
                groupIdx++;
            }
            monsterGroupMap[monsters[i].id] = groupIdx;
        }
        groupCounts.add(currentCount);

        int groupsSize = groupCounts.size();
        long[] prefixSum = new long[groupsSize];
        prefixSum[0] = groupCounts.get(0);
        for (int i = 1; i < groupsSize; i++) {
            prefixSum[i] = prefixSum[i-1] + groupCounts.get(i);
        }
        long totalMonsters = prefixSum[groupsSize - 1];

        for (int i = 0; i < Q; i++) {
            st = new StringTokenizer(br.readLine());
            int startId = Integer.parseInt(st.nextToken()) - 1;
            int endId = Integer.parseInt(st.nextToken()) - 1;

            int startGroup = monsterGroupMap[startId];
            int endGroup = monsterGroupMap[endId];

            long ans = 0;

            if (startGroup >= endGroup) {
                long countAtEndPrev = (endGroup == 0) ? 0 : prefixSum[endGroup - 1];
                ans = prefixSum[startGroup] - countAtEndPrev;
            } else {
                long countStartPart = prefixSum[startGroup]; 
                long countEndPart = totalMonsters - prefixSum[endGroup - 1]; 
                ans = countStartPart + countEndPart;
            }
            out.println(ans);
        }
        out.flush();
    }

    static boolean isTop(Monster m) {
        if (m.y > 0) return true;
        if (m.y < 0) return false;
        return m.x > 0; 
    }
}

提出情報

ジャッジ結果