File size: 16,381 Bytes
77f31ea | 1 2 3 4 5 6 7 8 9 10 11 12 13 | submission_id,user_id,create_at,language,score,problem_set_problem_id,problem_id,skill_id,code,response,time_consume,memory_consume
1454325616047976448,bdbe378a7dad712d6c6cbaa0ec6046fb7589d7cfbe24e6fa2e034920fec16090,2021-10-30 13:53:41,C++,0.0,1454297464424243203,1453691708244168704,1336283931886252032,"#include<bits/stdc++.h>\nusing namespace std;\nint mian()\n{\n\n char cha[999];\nstring s=\""hello\"";\n int i=0;\n for(auto &c : s)\n {\n cha[i]=c;\n i++;\n }\ncout<<cha[0];\n return 0;\n}",COMPILE_ERROR,0,0
1454366765689335808,4e1d818377068e5263ea85b39e7197e07aff95034e64510316c9c3dd916a39a5,2021-10-30 16:37:12,C++,0.0,1454297464424243203,1453691708244168704,1336283931886252032,"#include <bits/stdc++.h>\n#define int long long\nusing namespace std;\n\nint s[10][10];\nint a[20];\nint n,ans;\nvoid init()\n{\n for(int i=0;i<10;i++)\n for(int j=0;j<10;j++)\n s[i][j] = -1;\n s[1][1] = a[0];\n s[1][2] = a[1];\n s[1][4] = a[2];\n s[1][5] = a[3];\n s[2][2] = a[4];\n s[2][3] = a[5];\n s[2][4] = a[6];\n s[3][2] = a[7];\n s[3][3] = a[8];\n s[3][4] = a[9];\n s[4][2] = a[10];\n s[4][3] = a[11];\n s[4][4] = a[12];\n s[5][1] = a[13];\n s[5][2] = a[14];\n s[5][4] = a[15];\n s[5][5] = a[16];\n\n}\n\n\nint dx[4] = {0,0,1,-1},dy[4] = {1,-1,0,0};\nvoid dfs(int x,int y,int res, int cnt)\n{\n if(cnt>17||res<6) return;\n ans = max(ans,cnt);\n for(int i=0;i<4;i++)\n {\n int dx_x = dx[i]+x,dy_y = dy[i]+y;\n if(s[dx_x][dy_y]!=-1)\n {\n int biao = s[dx_x][dy_y];\n int sum = s[dx_x][dy_y];\n if(sum%6!=0)\n {\n sum = sum/6*6+6;\n }\n if(res>=sum)\n {\n dfs(dx_x,dy_y,res-sum,cnt+1);\n s[dx_x][dy_y] = -1;\n //s[dx_x][dy_y] = biao;\n }\n }\n }\n\n}\n\nsigned main()\n{\n int t;\n cin>>t;\n while(t--)\n {\n for(int i=0;i<17;i++) cin>>a[i];\n init();\n ans =0;\n cin>>n;\n if(n*6>=s[5][1])\n {\n ans = 1;\n dfs(5,1,n*6,1);\n }\n cout<<ans<<\""\\n\"";\n\n }\n return 0;\n}\n//16 18 10 9 50 46 70 60 38 51 18 30 30 20 16 18 36\n",WRONG_ANSWER,7,332
1454366792386473984,4e1d818377068e5263ea85b39e7197e07aff95034e64510316c9c3dd916a39a5,2021-10-30 16:37:18,C++,0.0,1454297464424243203,1453691708244168704,1336283931886252032,"#include <bits/stdc++.h>\n#define int long long\nusing namespace std;\n\nint s[10][10];\nint a[20];\nint n,ans;\nvoid init()\n{\n for(int i=0;i<10;i++)\n for(int j=0;j<10;j++)\n s[i][j] = -1;\n s[1][1] = a[0];\n s[1][2] = a[1];\n s[1][4] = a[2];\n s[1][5] = a[3];\n s[2][2] = a[4];\n s[2][3] = a[5];\n s[2][4] = a[6];\n s[3][2] = a[7];\n s[3][3] = a[8];\n s[3][4] = a[9];\n s[4][2] = a[10];\n s[4][3] = a[11];\n s[4][4] = a[12];\n s[5][1] = a[13];\n s[5][2] = a[14];\n s[5][4] = a[15];\n s[5][5] = a[16];\n\n}\n\n\nint dx[4] = {0,0,1,-1},dy[4] = {1,-1,0,0};\nvoid dfs(int x,int y,int res, int cnt)\n{\n if(cnt>17||res<6) return;\n ans = max(ans,cnt);\n for(int i=0;i<4;i++)\n {\n int dx_x = dx[i]+x,dy_y = dy[i]+y;\n if(s[dx_x][dy_y]!=-1)\n {\n int biao = s[dx_x][dy_y];\n int sum = s[dx_x][dy_y];\n if(sum%6!=0)\n {\n sum = sum/6*6+6;\n }\n if(res>=sum)\n {\n dfs(dx_x,dy_y,res-sum,cnt+1);\n s[dx_x][dy_y] = -1;\n //s[dx_x][dy_y] = biao;\n }\n }\n }\n\n}\n\nsigned main()\n{\n int t;\n cin>>t;\n while(t--)\n {\n for(int i=0;i<17;i++) cin>>a[i];\n init();\n ans =0;\n cin>>n;\n if(n*6>=s[5][1])\n {\n ans = 1;\n dfs(5,1,n*6,1);\n }\n cout<<ans<<\""\\n\"";\n\n }\n return 0;\n}\n//16 18 10 9 50 46 70 60 38 51 18 30 30 20 16 18 36\n",WRONG_ANSWER,8,388
1454366806051516416,4e1d818377068e5263ea85b39e7197e07aff95034e64510316c9c3dd916a39a5,2021-10-30 16:37:22,C++,0.0,1454297464424243203,1453691708244168704,1336283931886252032,"#include <bits/stdc++.h>\n#define int long long\nusing namespace std;\n\nint s[10][10];\nint a[20];\nint n,ans;\nvoid init()\n{\n for(int i=0;i<10;i++)\n for(int j=0;j<10;j++)\n s[i][j] = -1;\n s[1][1] = a[0];\n s[1][2] = a[1];\n s[1][4] = a[2];\n s[1][5] = a[3];\n s[2][2] = a[4];\n s[2][3] = a[5];\n s[2][4] = a[6];\n s[3][2] = a[7];\n s[3][3] = a[8];\n s[3][4] = a[9];\n s[4][2] = a[10];\n s[4][3] = a[11];\n s[4][4] = a[12];\n s[5][1] = a[13];\n s[5][2] = a[14];\n s[5][4] = a[15];\n s[5][5] = a[16];\n\n}\n\n\nint dx[4] = {0,0,1,-1},dy[4] = {1,-1,0,0};\nvoid dfs(int x,int y,int res, int cnt)\n{\n if(cnt>17||res<6) return;\n ans = max(ans,cnt);\n for(int i=0;i<4;i++)\n {\n int dx_x = dx[i]+x,dy_y = dy[i]+y;\n if(s[dx_x][dy_y]!=-1)\n {\n int biao = s[dx_x][dy_y];\n int sum = s[dx_x][dy_y];\n if(sum%6!=0)\n {\n sum = sum/6*6+6;\n }\n if(res>=sum)\n {\n dfs(dx_x,dy_y,res-sum,cnt+1);\n s[dx_x][dy_y] = -1;\n //s[dx_x][dy_y] = biao;\n }\n }\n }\n\n}\n\nsigned main()\n{\n int t;\n cin>>t;\n while(t--)\n {\n for(int i=0;i<17;i++) cin>>a[i];\n init();\n ans =0;\n cin>>n;\n if(n*6>=s[5][1])\n {\n ans = 1;\n dfs(5,1,n*6,1);\n }\n cout<<ans<<\""\\n\"";\n\n }\n return 0;\n}\n//16 18 10 9 50 46 70 60 38 51 18 30 30 20 16 18 36\n",WRONG_ANSWER,8,604
1454371317889003520,4e1d818377068e5263ea85b39e7197e07aff95034e64510316c9c3dd916a39a5,2021-10-30 16:55:17,C++,0.0,1454297464424243203,1453691708244168704,1336283931886252032,"#include <bits/stdc++.h>\n#define int long long\nusing namespace std;\n/*\nint s[10][10];\nint a[20];\nint n,ans;\nvoid init()\n{\n for(int i=0;i<10;i++)\n for(int j=0;j<10;j++)\n s[i][j] = -1;\n s[1][1] = a[0];\n s[1][2] = a[1];\n s[1][4] = a[2];\n s[1][5] = a[3];\n s[2][2] = a[4];\n s[2][3] = a[5];\n s[2][4] = a[6];\n s[3][2] = a[7];\n s[3][3] = a[8];\n s[3][4] = a[9];\n s[4][2] = a[10];\n s[4][3] = a[11];\n s[4][4] = a[12];\n s[5][1] = a[13];\n s[5][2] = a[14];\n s[5][4] = a[15];\n s[5][5] = a[16];\n\n}\n\n\nint dx[4] = {0,0,1,-1},dy[4] = {1,-1,0,0};\nvoid dfs(int x,int y,int res, int cnt)\n{\n if(cnt>17||res<6) return;\n ans = max(ans,cnt);\n for(int i=0;i<4;i++)\n {\n int dx_x = dx[i]+x,dy_y = dy[i]+y;\n if(s[dx_x][dy_y]!=-1)\n {\n int biao = s[dx_x][dy_y];\n int sum = s[dx_x][dy_y];\n if(sum%6!=0)\n {\n sum = sum/6*6+6;\n }\n if(res>=sum)\n {\n res-=sum;\n dfs(dx_x,dy_y,res,cnt+1);\n s[dx_x][dy_y] = 0;\n //s[dx_x][dy_y] = biao;\n }\n }\n }\n\n}\n*/\nsigned main()\n{\n /*int t;\n cin>>t;\n while(t--)\n {\n for(int i=0;i<17;i++) cin>>a[i];\n init();\n ans =0;\n cin>>n;\n if(n*6>=s[5][1])\n {\n ans = 1;\n dfs(5,1,n*6,1);\n }\n cout<<ans<<\""\\n\"";\n\n }*/\n cout<<\""我看懂了 我会 我就是不交\""<<endl;\n return 0;\n}\n//16 18 10 9 50 46 70 60 38 51 18 30 30 20 16 18 36\n",WRONG_ANSWER,6,332
1454371858811711488,0ba772fd9a8cfcb3c1436c74a9326f3ecf2e946ef2ca58f68c9069b269be03b2,2021-10-30 16:57:26,C++,0.0,1454297464424243203,1453691708244168704,1336283931886252032,"#include<bits/stdc++.h>\n\nusing namespace std;\n#define int long long\n#define endl '\\n'\nconst int maxn = 1e6+1;\n\n\nsigned main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n int T;\n cin >> T;\n while(T --) {\n int n,m,k;\n cin>>n>>m>>k;\n vector<vector<int>> nana(n+10,vector<int> (m+10)),pre(n+10,vector<int> (m+10));\n for(int i=1;i<=n;i++)\n {\n for(int j=1;j<=m;j++)\n cin>>nana[i][j];\n sort(nana[i].begin()+1,nana[i].begin()+1+m,greater<int>());\n for(int j=1;j<=m;j++)\n pre[i][j]=pre[i][j-1]+nana[i][j];\n }\n vector<pair<int,int> > jie(n+10);\n vector<int> zanzancun;\n int sum=0;\n int toljishu=0;\n int zuixiao=0;\n int zuiduo=0;\n for(int i=1;i<=n;i++)\n {\n cin>>jie[i].first>>jie[i].second;\n sum+=pre[i][jie[i].first];\n toljishu+=jie[i].first;\n zuixiao+=jie[i].first;\n zuiduo+=jie[i].second;\n for(int j=1;j<=jie[i].first;j++)\n zanzancun.push_back(nana[i][j]);\n }\n sort(zanzancun.begin(),zanzancun.end(),greater<int>());\n multiset<int> jihe;\n int jihehe=0;\n for(int i=0;i<k&&i<zanzancun.size();i++)\n jihe.insert(zanzancun[i]),jihehe+=zanzancun[i];\n vector<int> cun;\n vector<int> daan(n*m+10);\n daan[toljishu]=sum+jihehe;\n for(int i=1;i<=n;i++)\n for(int j=jie[i].first+1;j<=jie[i].second;j++)\n cun.push_back(nana[i][j]);\n sort(cun.begin(),cun.end(),greater<int>());\n for(int i=toljishu+1;i<=zuiduo;i++)\n {\n if(jihe.size()<k)\n jihe.insert(cun[i-toljishu-1]),sum+=cun[i-toljishu-1],jihehe+=cun[i-toljishu-1];\n else\n {\n sum+=cun[i-toljishu-1];\n jihehe+=cun[i-toljishu-1];\n jihe.insert(cun[i-toljishu-1]);\n jihehe-=*jihe.begin();\n jihe.erase(jihe.begin());\n }\n daan[i]=sum+jihehe;\n }\n int ans=0;\n for(int i=zuixiao;i<=zuiduo;i++)\n {\n //cout<<daan[i]<<\"" \"";\n ans^=daan[i];\n }\n //cout<<endl;\n cout<<ans<<endl;\n }\n return 0;\n}\n",MEMORY_LIMIT_EXCEEDED,0,0
1454371951140925440,f9a6c15450e87400acb11ae4141dec35b96c55338c6f8edf7318283390b5d675,2021-10-30 16:57:48,C,0.0,1454297464424243203,1453691708244168704,1336283931886252032,"#include<stdio.h>\n\nint main(){\n printf(\""0\\n\n499122178\\n\n448445996\\n\n\"");\n}",COMPILE_ERROR,0,0
1454372072897032192,f9a6c15450e87400acb11ae4141dec35b96c55338c6f8edf7318283390b5d675,2021-10-30 16:58:17,C,0.0,1454297464424243203,1453691708244168704,1336283931886252032,"#include<stdio.h>\n\nint main(){\n printf(\""0\\n499122178\\n448445996\\n\"");\n}",WRONG_ANSWER,5,328
1454372151339249664,4d2008fb3374c18b5636696e9534c84cbb226072f1f25a1b707ab0e35a7ca171,2021-10-30 16:58:36,C++,0.0,1454297464424243203,1453691708244168704,1336283931886252032,"#include <iostream>\nusing namespace std ;\nint main()\n{\n for( int i = 1 ; i <= 10000 ; i++ )\n {\n cout << \""写不出来啦！！！\"" ;\n }\n}\n",WRONG_ANSWER,7,640
1454372419199741952,0ba772fd9a8cfcb3c1436c74a9326f3ecf2e946ef2ca58f68c9069b269be03b2,2021-10-30 16:59:40,C++,0.0,1454297464424243203,1453691708244168704,1336283931886252032,"#include<bits/stdc++.h>\n\nusing namespace std;\n#define int long long\n#define endl '\\n'\nconst int maxn = 1e6+1;\n\n\nsigned main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n int T;\n cin >> T;\n while(T --) {\n int n,m,k;\n cin>>n>>m>>k;\n vector<vector<int>> nana(n+10,vector<int> (m+10)),pre(n+10,vector<int> (m+10));\n for(int i=1;i<=n;i++)\n {\n for(int j=1;j<=m;j++)\n cin>>nana[i][j];\n sort(nana[i].begin()+1,nana[i].begin()+1+m,greater<int>());\n for(int j=1;j<=m;j++)\n pre[i][j]=pre[i][j-1]+nana[i][j];\n }\n vector<pair<int,int> > jie(n+10);\n vector<int> zanzancun;\n int sum=0;\n int toljishu=0;\n int zuixiao=0;\n int zuiduo=0;\n for(int i=1;i<=n;i++)\n {\n cin>>jie[i].first>>jie[i].second;\n sum+=pre[i][jie[i].first];\n toljishu+=jie[i].first;\n zuixiao+=jie[i].first;\n zuiduo+=jie[i].second;\n for(int j=1;j<=jie[i].first;j++)\n zanzancun.push_back(nana[i][j]);\n }\n sort(zanzancun.begin(),zanzancun.end(),greater<int>());\n multiset<int> jihe;\n int jihehe=0;\n for(int i=0;i<k&&i<zanzancun.size();i++)\n jihe.insert(zanzancun[i]),jihehe+=zanzancun[i];\n vector<int> cun;\n vector<int> daan(n*m+10);\n daan[toljishu]=sum+jihehe;\n for(int i=1;i<=n;i++)\n for(int j=jie[i].first+1;j<=jie[i].second;j++)\n cun.push_back(nana[i][j]);\n sort(cun.begin(),cun.end(),greater<int>());\n for(int i=toljishu+1;i<=zuiduo;i++)\n {\n if(jihe.size()<k)\n jihe.insert(cun[i-toljishu-1]),sum+=cun[i-toljishu-1],jihehe+=cun[i-toljishu-1];\n else\n {\n sum+=cun[i-toljishu-1];\n jihehe+=cun[i-toljishu-1];\n jihe.insert(cun[i-toljishu-1]);\n jihehe-=*jihe.begin();\n jihe.erase(jihe.begin());\n }\n daan[i]=sum+jihehe;\n }\n int ans=0;\n for(int i=zuixiao;i<=zuiduo;i++)\n {\n //cout<<daan[i]<<\"" \"";\n ans^=daan[i];\n }\n //cout<<endl;\n cout<<ans<<endl;\n }\n return 0;\n}\n",MEMORY_LIMIT_EXCEEDED,0,0
1454372459021201408,2a7b5346892cef1c8ba333b2ee82ae08e4019a9dfddcc0db14508d8affc63f78,2021-10-30 16:59:49,C++,0.0,1454297464424243203,1453691708244168704,1336283931886252032,"#include<bits/stdc++.h>\nlong long mod =998244353,di = 748683265;\nusing namespace std;\nlong long w[3][3];\nlong long a[1004][1004]={0};\nlong long b[1004][1004]={0};\nint pc[1004][1004]={0};\nint main() {\n // cout<<(22^25^28);\n// cout<<(9*di)%mod;\n// long long a[14][14]={0};\n// long long b[14][14]={0};\n int T;scanf(\""%d\"",&T);\n while(T--){\n memset(pc,0,sizeof(pc));\n int n,m;\n scanf(\""%d %d\"",&n,&m);\n for(int i=0;i<3;i++){\n for(int j=0;j<3;j++){\n scanf(\""%d\"",&w[i][j]);\n }\n }\n for(int i=2;i<n+2;i++){\n getchar();\n for(int j=2;j<n+2;j++){\n char c=getchar();\n pc[i][j]=1;\n if(c=='1'){a[i][j]=1;}\n else a[i][j]=0;\n }\n }long long ans =0,dis=1;\n int z = 1;\n while(m--){\n for(int i=2;i<4+n;i++){\n for(int j=2;j<4+n;j++){\n b[i][j]=0;\n for(int ti = 0;ti<3;ti++){\n for(int tj=0;tj<3;tj++){\n if(i-ti>=n+2||j-tj>=n+2)a[i-ti][j-tj]=0;\n b[i][j]=(w[2-ti][2-tj]*a[i-ti][j-tj]+b[i][j])%mod;\n }\n }\n }\n }\n int num,tt;\n if(n%2){\n num =(n+3)/2;\n tt=1;\n }\n else{\n num=(n+4)/2;\n tt=1;\n }\n ans=0;\n for(int i=0;i<num;i++){\n for(int j=0;j<num;j++){\n a[i+2][j+2]=0;\n for(int ti = 0;ti<2;ti++){\n for(int tj=0;tj<2;tj++){ \n a[i+2][j+2]=(b[i*2+ti+1][j*2+tj+1]+a[i+2][j+2])%mod;\n }\n }\n a[i+2][j+2] = (a[i+2][j+2]*di)%mod;\n // pc[i+2][j+2]=z+1;\n ans=(ans+a[i+2][j+2])%mod;\n }\n }\n n = num;\n z++;\n }\n // ans=(ans*dis)%mod;\n printf(\""%lld\\n\"",ans);\n }\n// system(\""pause\"");\n return 0;\n\n} //249561092",TIME_LIMIT_EXCEEDED,0,0
|