Submission #40676689


Source Code Expand

#include <bits/stdc++.h>
using namespace std;
signed main() {
	int n, q;
	scanf("%d%d", &n, &q);
	map<int, multiset<int> > mp1;
	map<int, set<int> > mp2;
	while (q--) {
		int op, x, y;
		scanf("%d%d", &op, &x);
		if (op == 1) {
			scanf("%d", &y);
			mp1[y].insert(x), mp2[x].insert(y);
		}
		else if (op == 2) {
			for (int tmp : mp1[x])
				printf("%d ", tmp);
			puts("");
		}
		else {
			for (int tmp : mp2[x])
				printf("%d ", tmp);
			puts("");
		}
	}
	return 0;
}

Submission Info

Submission Time
Task C - Cards Query Problem
User cxm1024
Language C++ (GCC 9.2.1)
Score 300
Code Size 497 Byte
Status AC
Exec Time 293 ms
Memory 39328 KiB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:5:7: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
    5 |  scanf("%d%d", &n, &q);
      |  ~~~~~^~~~~~~~~~~~~~~~
./Main.cpp:10:8: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   10 |   scanf("%d%d", &op, &x);
      |   ~~~~~^~~~~~~~~~~~~~~~~
./Main.cpp:12:9: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   12 |    scanf("%d", &y);
      |    ~~~~~^~~~~~~~~~

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 2
AC × 30
Set Name Test Cases
Sample sample00.txt, sample01.txt
All sample00.txt, sample01.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, testcase14.txt, testcase15.txt, testcase16.txt, testcase17.txt, testcase18.txt, testcase19.txt, testcase20.txt, testcase21.txt, testcase22.txt, testcase23.txt, testcase24.txt, testcase25.txt, testcase26.txt, testcase27.txt
Case Name Status Exec Time Memory
sample00.txt AC 7 ms 3748 KiB
sample01.txt AC 2 ms 3748 KiB
testcase00.txt AC 100 ms 13108 KiB
testcase01.txt AC 79 ms 13120 KiB
testcase02.txt AC 23 ms 3820 KiB
testcase03.txt AC 32 ms 4560 KiB
testcase04.txt AC 27 ms 3832 KiB
testcase05.txt AC 31 ms 4632 KiB
testcase06.txt AC 29 ms 3988 KiB
testcase07.txt AC 56 ms 6560 KiB
testcase08.txt AC 111 ms 11520 KiB
testcase09.txt AC 52 ms 6008 KiB
testcase10.txt AC 29 ms 4004 KiB
testcase11.txt AC 60 ms 6904 KiB
testcase12.txt AC 119 ms 12044 KiB
testcase13.txt AC 51 ms 5932 KiB
testcase14.txt AC 29 ms 3884 KiB
testcase15.txt AC 59 ms 6752 KiB
testcase16.txt AC 119 ms 12204 KiB
testcase17.txt AC 53 ms 6124 KiB
testcase18.txt AC 277 ms 38892 KiB
testcase19.txt AC 265 ms 38136 KiB
testcase20.txt AC 275 ms 39100 KiB
testcase21.txt AC 269 ms 38624 KiB
testcase22.txt AC 276 ms 39140 KiB
testcase23.txt AC 293 ms 39272 KiB
testcase24.txt AC 268 ms 39328 KiB
testcase25.txt AC 279 ms 39228 KiB
testcase26.txt AC 277 ms 39324 KiB
testcase27.txt AC 274 ms 39328 KiB