Submission #311636

Source Code Expand

#include <iostream>
using namespace std;

int main(){
  int N=0,M=0;
  int frm=0,to=0;
  cin >> N >> M;
  int **Array= new int*[N];
  for(int j=0;j<N;j++)
    Array[j] = new int[N];

  //init
  for(int i=0;i<M;i++)
    {
      cin >>frm >>to;
      Array[frm-1][to-1]=1;
	}
  //  int DS=0;
  int count=0;
  int add=0;
  for(int i=1;i<N;i++)  {
    count=0;
    for(int j=0;j<i;j++){
      //      cout << Array[j][i] <<"  ";
      if(Array[j][i])
	count++;
    }
    //cout<<"  count= "<< count <<endl;
    if(count==0)
      add++;
  }
  cout <<add<<endl;
  return 0;

}

Submission Info

Submission Time
Task B - 道路工事
User js_min
Language C++11 (GCC 4.8.1)
Score 0
Code Size 607 Byte
Status WA
Exec Time 2206 ms
Memory 796320 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 100
Status
AC × 2
AC × 15
WA × 1
TLE × 4
Set Name Test Cases
Sample sample1.txt, sample2.txt
All 0.txt, 1.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 2.txt, 3.txt, 4.txt, 5.txt, 6.txt, 7.txt, 8.txt, 9.txt
Case Name Status Exec Time Memory
0.txt AC 23 ms 748 KiB
1.txt AC 25 ms 760 KiB
10.txt AC 22 ms 800 KiB
11.txt AC 23 ms 796 KiB
12.txt AC 32 ms 4644 KiB
13.txt AC 33 ms 4628 KiB
14.txt AC 31 ms 4768 KiB
15.txt WA 104 ms 4644 KiB
16.txt TLE 2164 ms 401648 KiB
17.txt TLE 2161 ms 401712 KiB
18.txt TLE 2163 ms 401708 KiB
19.txt TLE 2206 ms 796320 KiB
2.txt AC 25 ms 764 KiB
3.txt AC 21 ms 804 KiB
4.txt AC 22 ms 732 KiB
5.txt AC 23 ms 928 KiB
6.txt AC 23 ms 812 KiB
7.txt AC 24 ms 800 KiB
8.txt AC 23 ms 916 KiB
9.txt AC 22 ms 800 KiB
sample1.txt AC 23 ms 800 KiB
sample2.txt AC 23 ms 804 KiB