제출 #1339085

#제출 시각아이디문제언어결과실행 시간메모리
1339085vjudge1Flood (IOI07_flood)C++20
0 / 100
98 ms2204 KiB
#include <bits/stdc++.h>
using namespace std;  
int main()
{
   int N;
   cin>>N;
   int X[N],Y[N];
   for (int i=1;i<N+1;i++)
   {
      cin>>X[i]>>Y[i];
   } 
   int W;
   int A[W],B[W];
   cin>>W;
   int a=W;
   for (int i=1;i<W+1;i++)
   {
      cin>>A[i]>>B[i];
   }  
   int K=0;
   int Vx[W];
   int Vy[W];
   for (int i=1;i<W+1;i++)
   {
     Vx[i]=X[A[i]]-X[B[i]];
     Vy[i]=Y[A[i]]-Y[B[i]];
   }
   for (int i=1;i<W+1;i++)
   {
     if (Vx[i]>Vx[i+1] && Vy[i]>Vy[i+1])
     {
       W--;
       continue;
     }
   }
   cout<<W<<endl;
   for (int i=1;i<a+1;i++)
   {
     if (Vx[i]<Vx[i+1] && Vy[i]<Vy[i+1])
     {
        cout<<i<<endl;
        continue;
     }
    }
   

   return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...