Submission #50788605

Source Code Expand

#include <iostream>
#include <vector>
using namespace std;
using ll = long long;

int main() {
  int N;
  cin >> N;

  vector<vector<int>> graph(N, vector<int>(N, 0));

  for (int i = 0; i < N; i++) {
    for (int j = 0; j < N; j++) {
      cin >> graph[i][j];
      if (graph[i][j] == 1) {
        cout << j + 1 << " ";
      }
    }
    cout << endl;
  }
}

Submission Info

Submission Time
Task B - Adjacency Matrix
User noyan
Language C++ 23 (gcc 12.2)
Score 150
Code Size 358 Byte
Status AC
Exec Time 12 ms
Memory 3708 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 150 / 150
Status
AC × 3
AC × 17
Set Name Test Cases
Sample sample00.txt, sample01.txt, sample02.txt
All sample00.txt, sample01.txt, sample02.txt, testcase00.txt, testcase01.txt, testcase02.txt, testcase03.txt, testcase04.txt, testcase05.txt, testcase06.txt, testcase07.txt, testcase08.txt, testcase09.txt, testcase10.txt, testcase11.txt, testcase12.txt, testcase13.txt
Case Name Status Exec Time Memory
sample00.txt AC 1 ms 3472 KiB
sample01.txt AC 1 ms 3392 KiB
sample02.txt AC 1 ms 3404 KiB
testcase00.txt AC 2 ms 3504 KiB
testcase01.txt AC 2 ms 3572 KiB
testcase02.txt AC 4 ms 3508 KiB
testcase03.txt AC 4 ms 3576 KiB
testcase04.txt AC 5 ms 3512 KiB
testcase05.txt AC 5 ms 3708 KiB
testcase06.txt AC 7 ms 3520 KiB
testcase07.txt AC 7 ms 3572 KiB
testcase08.txt AC 8 ms 3512 KiB
testcase09.txt AC 9 ms 3576 KiB
testcase10.txt AC 9 ms 3568 KiB
testcase11.txt AC 10 ms 3544 KiB
testcase12.txt AC 10 ms 3708 KiB
testcase13.txt AC 12 ms 3576 KiB