Submission #1971913
Source Code Expand
#include <iostream> #include <algorithm> #include <cstdio> #include <cstring> #include <queue> #include <vector> #include <bitset> #include <string> #include <cmath> #include <set> #include <map> #define Rep(i, x, y) for (int i = x; i <= y; i ++) #define Dwn(i, x, y) for (int i = x; i >= y; i --) #define RepE(i, x) for (int i = pos[x]; i; i = g[i].nex) #define ev g[i].y #define eps 1e-10 using namespace std; typedef long long ll; typedef double db; const int N = 100005, mod = 1000000007; int n, m, ind[N], outd[N], pos[N], sz; bool vis[N], fl; struct edge { int y, nex; } g[N * 2]; void init(int x, int y) { g[++ sz] = (edge) { y, pos[x] }, pos[x] = sz; } int node(int x, int y) { return !y ? x : -y; } void dfs(int x) { vis[x] = 1; RepE(i, x) if (!vis[ev]) dfs(ev); } int main() { scanf ("%d%d", &m, &n); Rep(i, 1, m) { int a, b, c, d; scanf ("%d%d%d%d", &a, &b, &c, &d); int x = node(a, c), y = -node(b, d); if (x < 0) x = n + (-x); if (y < 0) y = n + (-y); ind[y] ++; outd[x] ++; // cout << x<<" "<<y<<endl; init(x, y); } Rep(i, 1, n) { if (ind[i] > outd[i]) fl = 1; if (ind[i + n] < outd[i + n]) fl = 1; } // cout << fl<<endl; Rep(i, 1, n * 2) { if (ind[i] == outd[i]) continue ; if (!vis[i]) dfs(i); } Rep(i, 1, n * 2) if (ind[i] && !vis[i]) fl = 1; puts(fl ? "NO" : "YES"); return 0; }
Submission Info
Submission Time | |
---|---|
Task | E - Jigsaw |
User | hzt1 |
Language | C++14 (GCC 5.4.1) |
Score | 1200 |
Code Size | 1394 Byte |
Status | AC |
Exec Time | 29 ms |
Memory | 1024 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:34:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf ("%d%d", &m, &n); ^ ./Main.cpp:37:37: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf ("%d%d%d%d", &a, &b, &c, &d); ^
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 1200 / 1200 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample1.txt, sample2.txt, sample3.txt |
All | sample1.txt, sample2.txt, sample3.txt, a1.txt, a2.txt, a3.txt, b1.txt, b10.txt, b101.txt, b102.txt, b103.txt, b104.txt, b105.txt, b106.txt, b107.txt, b108.txt, b109.txt, b11.txt, b110.txt, b111.txt, b112.txt, b113.txt, b114.txt, b115.txt, b116.txt, b117.txt, b118.txt, b119.txt, b12.txt, b13.txt, b14.txt, b15.txt, b2.txt, b200.txt, b201.txt, b202.txt, b203.txt, b204.txt, b205.txt, b206.txt, b207.txt, b208.txt, b209.txt, b210.txt, b211.txt, b212.txt, b213.txt, b214.txt, b215.txt, b216.txt, b217.txt, b218.txt, b219.txt, b3.txt, b300.txt, b301.txt, b302.txt, b303.txt, b304.txt, b305.txt, b306.txt, b307.txt, b308.txt, b309.txt, b310.txt, b311.txt, b4.txt, b5.txt, b6.txt, b7.txt, b8.txt, b9.txt, c1.txt, c2.txt, c3.txt, c4.txt, c5.txt, d1.txt, d2.txt, d3.txt, d4.txt, sample1.txt, sample2.txt, sample3.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
a1.txt | AC | 1 ms | 256 KB |
a2.txt | AC | 4 ms | 384 KB |
a3.txt | AC | 28 ms | 1024 KB |
b1.txt | AC | 1 ms | 256 KB |
b10.txt | AC | 6 ms | 384 KB |
b101.txt | AC | 28 ms | 1024 KB |
b102.txt | AC | 28 ms | 1024 KB |
b103.txt | AC | 28 ms | 1024 KB |
b104.txt | AC | 28 ms | 1024 KB |
b105.txt | AC | 28 ms | 1024 KB |
b106.txt | AC | 13 ms | 640 KB |
b107.txt | AC | 26 ms | 1024 KB |
b108.txt | AC | 28 ms | 1024 KB |
b109.txt | AC | 25 ms | 1024 KB |
b11.txt | AC | 19 ms | 768 KB |
b110.txt | AC | 28 ms | 1024 KB |
b111.txt | AC | 28 ms | 1024 KB |
b112.txt | AC | 29 ms | 1024 KB |
b113.txt | AC | 28 ms | 1024 KB |
b114.txt | AC | 28 ms | 1024 KB |
b115.txt | AC | 13 ms | 640 KB |
b116.txt | AC | 26 ms | 1024 KB |
b117.txt | AC | 29 ms | 1024 KB |
b118.txt | AC | 22 ms | 896 KB |
b119.txt | AC | 25 ms | 1024 KB |
b12.txt | AC | 20 ms | 768 KB |
b13.txt | AC | 29 ms | 1024 KB |
b14.txt | AC | 28 ms | 1024 KB |
b15.txt | AC | 28 ms | 1024 KB |
b2.txt | AC | 4 ms | 384 KB |
b200.txt | AC | 28 ms | 1024 KB |
b201.txt | AC | 28 ms | 1024 KB |
b202.txt | AC | 28 ms | 1024 KB |
b203.txt | AC | 28 ms | 1024 KB |
b204.txt | AC | 28 ms | 1024 KB |
b205.txt | AC | 28 ms | 1024 KB |
b206.txt | AC | 28 ms | 1024 KB |
b207.txt | AC | 28 ms | 1024 KB |
b208.txt | AC | 28 ms | 1024 KB |
b209.txt | AC | 28 ms | 1024 KB |
b210.txt | AC | 28 ms | 1024 KB |
b211.txt | AC | 28 ms | 1024 KB |
b212.txt | AC | 28 ms | 1024 KB |
b213.txt | AC | 28 ms | 1024 KB |
b214.txt | AC | 28 ms | 1024 KB |
b215.txt | AC | 28 ms | 1024 KB |
b216.txt | AC | 28 ms | 1024 KB |
b217.txt | AC | 28 ms | 1024 KB |
b218.txt | AC | 28 ms | 1024 KB |
b219.txt | AC | 27 ms | 1024 KB |
b3.txt | AC | 28 ms | 1024 KB |
b300.txt | AC | 27 ms | 1024 KB |
b301.txt | AC | 27 ms | 1024 KB |
b302.txt | AC | 19 ms | 896 KB |
b303.txt | AC | 19 ms | 896 KB |
b304.txt | AC | 27 ms | 1024 KB |
b305.txt | AC | 27 ms | 1024 KB |
b306.txt | AC | 20 ms | 896 KB |
b307.txt | AC | 19 ms | 896 KB |
b308.txt | AC | 25 ms | 1024 KB |
b309.txt | AC | 27 ms | 1024 KB |
b310.txt | AC | 24 ms | 1024 KB |
b311.txt | AC | 24 ms | 1024 KB |
b4.txt | AC | 28 ms | 1024 KB |
b5.txt | AC | 4 ms | 384 KB |
b6.txt | AC | 4 ms | 384 KB |
b7.txt | AC | 4 ms | 384 KB |
b8.txt | AC | 4 ms | 384 KB |
b9.txt | AC | 4 ms | 384 KB |
c1.txt | AC | 24 ms | 1024 KB |
c2.txt | AC | 24 ms | 1024 KB |
c3.txt | AC | 20 ms | 896 KB |
c4.txt | AC | 24 ms | 1024 KB |
c5.txt | AC | 13 ms | 640 KB |
d1.txt | AC | 28 ms | 1024 KB |
d2.txt | AC | 28 ms | 1024 KB |
d3.txt | AC | 28 ms | 1024 KB |
d4.txt | AC | 22 ms | 896 KB |
sample1.txt | AC | 1 ms | 256 KB |
sample2.txt | AC | 1 ms | 256 KB |
sample3.txt | AC | 1 ms | 256 KB |