1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 | #include <iostream> using namespace std; #include <unordered_map> using namespace std; class Array; typedef pair<int, int> Point; template <typename A> struct MyHash { size_t operator()(const Point & p) const { return p.second * A::C + p.first; } }; class Array { public: typedef unordered_map<Point, Array, MyHash<Array> > Map; static const int R = 5, C = 5; Map compute() {/*...*/} }; int main() { } |
I2luY2x1ZGUgPGlvc3RyZWFtPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKI2luY2x1ZGUgPHVub3JkZXJlZF9tYXA+Cgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKY2xhc3MgQXJyYXk7Cgp0eXBlZGVmIHBhaXI8aW50LCBpbnQ+IFBvaW50OwoKdGVtcGxhdGUgPHR5cGVuYW1lIEE+IApzdHJ1Y3QgTXlIYXNoCnsKICAgc2l6ZV90IG9wZXJhdG9yKCkoY29uc3QgUG9pbnQgJiBwKSBjb25zdCAKICAgewogICAgIHJldHVybiBwLnNlY29uZCAqIEE6OkMgKyBwLmZpcnN0OwogICB9Cn07CgpjbGFzcyBBcnJheSB7CnB1YmxpYzoKICAgIHR5cGVkZWYgdW5vcmRlcmVkX21hcDxQb2ludCwgQXJyYXksIE15SGFzaDxBcnJheT4gPiBNYXA7CiAgICBzdGF0aWMgY29uc3QgaW50IFIgPSA1LCBDID0gNTsKICAgIE1hcCBjb21wdXRlKCkgey8qLi4uKi99Cn07CgppbnQgbWFpbigpIHsKfQoK
-
upload with new input
-
result: Success time: 0s memory: 2824 kB returned value: 0
-
result: Success time: 0s memory: 2824 kB returned value: 0


